human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal path planning under temporal logic constraints"
  Abstract: In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the environment is modeled as a general transition system, enhanced with weighted transitions. The mission is specified by a general linear temporal logic formula. In addition, we require that an optimizing proposition must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot trajectory which minimizes the cost function. The problem is motivated by applications in robotic monitoring and data gathering. In this setting, the optimizing proposition is satisfied at all locations where data can be uploaded, and the entire formula specifies a complex (and infinite horizon) data collection mission. Our method utilizes B\"uchi automata to produce an automaton (which can be thought of as a graph) whose runs satisfy the temporal logic specification. We then present a graph algorithm which computes a path corresponding to the optimal robot trajectory. We also present an implementation for a robot performing a data gathering mission in a road network.

Connected through hyperedge HE-1 (induced by source paper "control of magnetic microrobot teams for temporal micromanipulation tasks"):
  with members:
    - "sampling based optimal control synthesis for multi robot systems under global temporal tasks"
    - "optimal multi robot path planning with ltl constraints guaranteeing correctness through synchronization"
    - "synthesis of distributed control and communication schemes from global ltl specifications"

Connected through hyperedge HE-2 (induced by source paper "t a heuristic search based algorithm for motion planning with temporal goals"):
  with members:
    - "sampling based temporal logic path planning"

Connected through hyperedge HE-3 (induced by source paper "extended ltlvis motion planning interface extended technical report"):
  with members:
    - "extended ltlvis motion planning interface"
    - "vispec a graphical tool for elicitation of mtl requirements"
    - "revision of specification automata under quantitative preferences"

Connected through hyperedge HE-4 (induced by source paper "timed automata approach for motion planning using metric interval temporal logic"):
  with members:
    - "optimal mission planner with timed temporal logic constraints"

Connected through hyperedge HE-5 (induced by source paper "extended ltlvis motion planning interface"):
  with members:
    - "revision of specification automata under quantitative preferences"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.RO(Robotics)