human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "measurement scheduling for cooperative localization in resource constrained conditions"):
  Abstract: This paper studies the measurement scheduling problem for a group of N mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life and communication bandwidth only a given number of relative measurements per robot are allowed at observation and update stage. Optimal selection of which teammates a robot should take a relative measurement from such that the updated joint localization uncertainty of the team is minimized is an NP-hard problem. In this paper, we propose a suboptimal greedy approach that allows each robot to choose its landmark robots locally in polynomial time. Our method, unlike the known results in the literature, does not assume full-observability of CL algorithm. Moreover, it does not require inter-robot communication at scheduling stage. That is, there is no need for the robots to collaborate to carry out the landmark robot selections. We discuss the application of our method in the context of an state-of-the-art decentralized CL algorithm and demonstrate its effectiveness through numerical simulations. Even though our solution does not come with rigorous performance guarantees, its low computational cost along with no communication requirement makes it an appealing solution for operatins with resource constrained robots.

Includes members:
  Member "cooperative localization under limited connectivity":
    also connected through other hyperedges:
      (none)
  Member "a resource aware approach to collaborative loop closure detection with provable performance guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "door slam distributed online and outlier resilient slam for robotic teams")
  Member "data efficient decentralized visual slam":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "kidnapped radar topological radar localisation using rotationally invariant metric learning")
  Member "scheduling nonlinear sensors for stochastic process estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sensor assignment algorithms to improve observability while tracking targets")
  Member "server assisted distributed cooperative localization over unreliable communication links":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperative localization under limited connectivity")
  Member "cooperative localization for mobile agents a recursive decentralized algorithm based on kalman filter decoupling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative localization under limited connectivity")

Question: Please tell me which class the source paper 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)