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 "on line planning and scheduling an application to controlling modular printers"):
  Abstract: We present a case study of artificial intelligence techniques applied to the control of production printing equipment. Like many other real-world applications, this complex domain requires high-speed autonomous decision-making and robust continual operation. To our knowledge, this work represents the first successful industrial application of embedded domain-independent temporal planning. Our system handles execution failures and multi-objective preferences. At its heart is an on-line algorithm that combines techniques from state-space planning and partial-order scheduling. We suggest that this general architecture may prove useful in other applications as more intelligent systems operate in continual, on-line settings. Our system has been used to drive several commercial prototypes and has enabled a new product architecture for our industrial partner. When compared with state-of-the-art off-line planners, our system is hundreds of times faster and often finds better plans. Our experience demonstrates that domain-independent AI planning based on heuristic search can flexibly handle time, resources, replanning, and multiple objectives in a high-speed practical application without requiring hand-coded control knowledge.

Includes members:
  Member "regression with respect to sensing actions and partial states":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a state based regression formulation for domains with sensing actions and incomplete information")
  Member "sapa a multi objective metric temporal planner":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interactive plan explicability in human robot teaming")
  Member "pddl2 1 an extension to pddl for expressing temporal planning domains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "planning through stochastic local search and temporal action graphs in lpg":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "automated algorithm selection survey and perspectives")
  Member "the ff planning system fast plan generation through heuristic search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")
  Member "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "planning based on classification by induction graph")
  Member "decision theoretic planning structural assumptions and computational leverage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal by design model driven synthesis of adaptation strategies for autonomous systems")
  Member "the automatic inference of state invariants in tim":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "guarantees for sound abstractions for generalized planning extended paper")

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