human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Global A-Optimal Robot Exploration in SLAM"
  Abstract: It is well-known that the Kalman filter for simultaneous localization and mapping (SLAM) converges to a fully correlated map in the limit of infinite time and data [1]. However, the rate of convergence of the map has a strong dependence on the order of the observations. We show that conventional exploration algorithms for collecting map data are sub-optimal in both the objective function and choice of optimization procedure. We show that optimizing the a-optimal information measure results in a more accurate map than existing approaches, using a greedy, closed-loop strategy. Secondly, we demonstrate that by restricting the planning to an appropriate policy class, we can tractably find non-greedy, global planning trajectories that produce more accurate maps, explicitly planning to close loops even in open-loop scenarios.

Connected through hyperedge HE-1 (induced by source paper "Mobile robot localization by tracking geometric beacons"):
  with members:
    - "Sensor models and multisensor integration"
    - "Vehicle Localization Using In-Vehicle Pitch Data and Dynamical Models"
    - "Predictive autonomous robot navigation"
    - "Robot Localization Using Omnidirectional Color Images"

Connected through hyperedge HE-2 (induced by source paper "Efficient informative sensing using multiple robots"):
  with members:
    - "Nonmyopic \(\epsilon\)-Bayes-Optimal Active Learning of Gaussian Processes"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Engineering