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: "overview generalizations of multi agent path finding to real world scenarios"
  Abstract: Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when generalizing MAPF methods to real-world scenarios and four research directions that address them. We emphasize the importance of addressing these issues as opposed to developing faster methods for the standard formulation of the MAPF problem.

Connected through hyperedge HE-1 (induced by source paper "a job assignment heuristic for lifelong multi agent path finding problem with multiple delivery locations"):
  with members:
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "optimal target assignment and path finding for teams of agents"

Connected through hyperedge HE-2 (induced by source paper "multi agent path finding with capacity constraints"):
  with members:
    - "multi agent path finding with deadlines"
    - "lazy modeling of variants of token swapping problem and multi agent path finding through combination of satisfiability modulo theories and conflict based search"
    - "towards search based motion planning for micro aerial vehicles"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"
    - "exploiting subgraph structure in multi robot path planning"

Connected through hyperedge HE-3 (induced by source paper "on the tour towards dpll mapf and beyond"):
  with members:
    - "multi agent pathfinding mapf with continuous time"
    - "multi agent path finding with continuous time viewed through satisfiability modulo theories smt"
    - "multi agent path finding with deadlines"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"
    - "exploiting subgraph structure in multi robot path planning"

Connected through hyperedge HE-4 (induced by source paper "multi agent path finding with continuous time viewed through satisfiability modulo theories smt"):
  with members:
    - "multi agent pathfinding mapf with continuous time"
    - "multi agent path finding with deadlines"
    - "optimal multi robot path planning on graphs structure and computational complexity"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"
    - "exploiting subgraph structure in multi robot path planning"

Connected through hyperedge HE-5 (induced by source paper "a constraint programming approach to simultaneous task allocation and motion scheduling for industrial dual arm manipulation tasks"):
  with members:
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "optimal target assignment and path finding for teams of agents"

Connected through hyperedge HE-6 (induced by source paper "multi agent path finding with deadlines preliminary results"):
  with members:
    - "overview a hierarchical framework for plan generation and execution in multirobot systems"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "feasibility study moving non homogeneous teams in congested video game environments"
    - "optimal target assignment and path finding for teams of agents"
    - "multi agent path finding with delay probabilities"
    - "planning optimal paths for multiple robots on graphs"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-7 (induced by source paper "searching with consistent prioritization for multi agent path finding"):
  with members:
    - "overview a hierarchical framework for plan generation and execution in multirobot systems"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "feasibility study moving non homogeneous teams in congested video game environments"
    - "complete decentralized method for on line multi robot trajectory planning in valid infrastructures"
    - "planning optimal paths for multiple robots on graphs"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-8 (induced by source paper "multi agent path finding with deadlines"):
  with members:
    - "overview a hierarchical framework for plan generation and execution in multirobot systems"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "feasibility study moving non homogeneous teams in congested video game environments"
    - "optimal target assignment and path finding for teams of agents"
    - "planning optimal paths for multiple robots on graphs"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

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.AI(Artificial Intelligence)