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: "a receding horizon approach to multi agent planning from local ltl specifications"
  Abstract: We study the problem of control synthesis for multi-agent systems, to achieve complex, high-level, long-term goals that are assigned to each agent individually. As the agents might not be capable of satisfying their respective goals by themselves, requests for other agents' collaborations are a part of the task descriptions. Particularly, we consider that the task specification takes a form of a linear temporal logic formula, which may contain requirements and constraints on the other agent's behavior. A traditional automata-based approach to multi-agent strategy synthesis from such specifications builds on centralized planning for the whole team and thus suffers from extreme computational demands. In this work, we aim at reducing the computational complexity by decomposing the strategy synthesis problem into short horizon planning problems that are solved iteratively, upon the run of the agents. We discuss the correctness of the solution and find assumptions, under which the proposed iterative algorithm leads to provable eventual satisfaction of the desired specifications.

Connected through hyperedge HE-1 (induced by source paper "robotic swarm control from spatio temporal specifications"):
  with members:
    - "robust temporal logic model predictive control"
    - "a formal methods approach to pattern synthesis in reaction diffusion systems"
    - "on line monitoring for temporal logic robustness"
    - "robust multi robot optimal path planning with temporal logic constraints"

Connected through hyperedge HE-2 (induced by source paper "decomposition of multi agent planning under distributed motion and task ltl specifications"):
  with members:
    - "multi agent planning under local ltl specifications and event based synchronization"
    - "cooperative decentralized multi agent control under local ltl tasks and connectivity constraints"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-3 (induced by source paper "multi agent planning under local ltl specifications and event based synchronization"):
  with members:
    - "attraction based receding horizon path planning with temporal logic constraints"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-4 (induced by source paper "communication free multi agent control under local temporal tasks and relative distance constraints"):
  with members:
    - "cooperative decentralized multi agent control under local ltl tasks and connectivity constraints"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-5 (induced by source paper "cooperative decentralized multi agent control under local ltl tasks and connectivity constraints"):
  with members:
    - "multi robot deployment from ltl specifications with reduced communication"

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)