4.7 Article

The Impact of HumanAutomation Collaboration in Decentralized Multiple Unmanned Vehicle Control

Journal

PROCEEDINGS OF THE IEEE
Volume 100, Issue 3, Pages 660-671

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JPROC.2011.2174104

Keywords

Command and control; decentralized task planning; decision support systems; humanautomation interaction; human supervisory control; unmanned vehicles

Funding

  1. U.S. Office of Naval Research STTR

Ask authors/readers for more resources

For future systems that require one or a small team of operators to supervise a network of automated agents, automated planners are critical since they are faster than humans for path planning and resource allocation in multivariate, dynamic, time-pressured environments. However, such planners can be brittle and unable to respond to emergent events. Human operators can aid such systems by bringing their knowledge-based reasoning and experience to bear. Given a decentralized task planner and a goal-based operator interface for a network of unmanned vehicles in a search, track, and neutralize mission, we demonstrate with a human-on-the-loop experiment that humans guiding these decentralized planners improved system performance by up to 50%. However, those tasks that required precise and rapid calculations were not significantly improved with human aid. Thus, there is a shared space in such complex missions for human-automation collaboration.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Robotics

Where to go Next: Learning a Subgoal Recommendation Policy for Navigation in Dynamic Environments

Bruno Brito, Michael Everett, Jonathan P. How, Javier Alonso-Mora

Summary: This method learns an interaction-aware policy through deep reinforcement learning to provide long-term guidance for robots, significantly improving robot navigation performance. Compared to previous MPC frameworks, the method performs remarkably well in terms of collision number, travel time, and collisions in cooperative, competitive, and mixed multiagent scenarios.

IEEE ROBOTICS AND AUTOMATION LETTERS (2021)

Article Robotics

Distributed Certifiably Correct Pose-Graph Optimization

Yulun Tian, Kasra Khosoussi, David M. Rosen, Jonathan P. How

Summary: This article introduces the first certified correct algorithm for distributed pose-graph optimization, which achieves globally optimal solutions and proposes the distributed Riemannian gradient framework and Riemannian block coordinate descent method. Extensive evaluations show that the proposed method can correctly recover globally optimal solutions under moderate noise.

IEEE TRANSACTIONS ON ROBOTICS (2021)

Article Robotics

Kimera-Multi: Robust, Distributed, Dense Metric-Semantic SLAM for Multi-Robot Systems

Yulun Tian, Yun Chang, Fernando Herrera Arias, Carlos Nieto-Granda, Jonathan P. How, Luca Carlone

Summary: This paper presents $\mathsf {\text{Kimera-Multi}}$, a multi-robot SLAM system that is robust, fully distributed, and capable of capturing semantic information. Experimental results demonstrate its superior performance.

IEEE TRANSACTIONS ON ROBOTICS (2022)

Article Robotics

FASTER: Fast and Safe Trajectory Planner for Navigation in Unknown Environments

Jesus Tordesillas, Brett T. Lopez, Michael Everett, Jonathan P. How

Summary: This paper introduces FASTER (Fast and Safe Trajectory Planner), which enables UAVs to fly at high speeds in unknown environments while ensuring safety. The algorithm optimizes the local planner in both the free-known and unknown spaces to achieve high-speed trajectories, with a safe back-up trajectory always available in the free-known space.

IEEE TRANSACTIONS ON ROBOTICS (2022)

Article Computer Science, Software Engineering

MINVO Basis: Finding Simplexes with Minimum Volume Enclosing Polynomial Curves

Jesus Tordesillas, Jonathan P. How

Summary: This paper studies the polynomial bases that generate the smallest n-simplex enclosing a given nth-degree polynomial curve in Rn. High-quality feasible solutions are obtained using Sum-Of-Squares programming, branch and bound, and moment relaxations. Global optimality is proven for n = 1, 2, 3.

COMPUTER-AIDED DESIGN (2022)

Article Computer Science, Artificial Intelligence

Certifiable Robustness to Adversarial State Uncertainty in Deep Reinforcement Learning

Michael Everett, Bjorn Lutjens, Jonathan P. How

Summary: This work leverages research on certified adversarial robustness to develop a defense mechanism for deep reinforcement learning algorithms that identifies and chooses robust actions in the worst case deviation in input space due to possible adversaries or noise. The approach is demonstrated to increase robustness to noise and adversaries in pedestrian collision avoidance scenarios, a classic control task, and Atari Pong.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2022)

Article Robotics

GraffMatch: Global Matching of 3D Lines and Planes for Wide Baseline LiDAR Registration

Parker C. Lusk, Devarth Parikh, Jonathan P. How

Summary: Using geometric landmarks like lines and planes can improve navigation accuracy and reduce map storage requirements. However, landmark-based registration for loop closure detection is challenging due to the lack of reliable initial guesses. We use the affine Grassmannian manifold to represent 3D lines and planes, proving their rotational and translational invariance, which enables accurate registration using our graph-based data association framework. Our approach outperforms other methods in landmark matching and registration tasks, achieving a 1.7x and 3.5x improvement in successful registrations.

IEEE ROBOTICS AND AUTOMATION LETTERS (2023)

Article Robotics

Incremental Non-Gaussian Inference for SLAM Using Normalizing Flows

Qiangqiang Huang, Can Pu, Kasra Khosoussi, David M. Rosen, Dehann Fourie, Jonathan P. How, John J. Leonard

Summary: This paper introduces NF-iSAM, a novel algorithm for inferring the full posterior distribution in SLAM problems with nonlinear measurement models and non-Gaussian factors. NF-iSAM uses neural networks and normalizing flows to model and sample the full posterior. By leveraging the Bayes tree, NF-iSAM achieves efficient incremental updates in the non-Gaussian setting. Experimental results on range-only SLAM problems with data association ambiguity show that NF-iSAM outperforms state-of-the-art algorithms in accuracy of posterior beliefs for continuous and discrete variables.

IEEE TRANSACTIONS ON ROBOTICS (2023)

Article Robotics

Deep-PANTHER: Learning-Based Perception-Aware Trajectory Planner in Dynamic Environments

Jesus Tordesillas, Jonathan P. How

Summary: This letter presents Deep-PANTHER, a learning-based perception-aware trajectory planner for unmanned aerial vehicles (UAVs) in dynamic environments. It uses imitation learning to train a policy that can generate multiple trajectories to avoid dynamic obstacles while maximizing the field of view of the onboard camera. Extensive simulations demonstrate that Deep-PANTHER outperforms an optimization-based expert in terms of replanning time and loss.

IEEE ROBOTICS AND AUTOMATION LETTERS (2023)

Article Robotics

MIXER: Multiattribute, Multiway Fusion of Uncertain Pairwise Affinities

Parker C. Lusk, Kaveh Fathian, Jonathan P. How

Summary: We propose a multiway fusion algorithm that can directly handle uncertain pairwise affinities. Instead of relying on initial pairwise associations like existing methods, our MIXER algorithm improves accuracy by utilizing the additional information provided by pairwise affinities. Our main contribution is a multiway fusion formulation suitable for non-binary affinities and a novel continuous relaxation that guarantees binary solutions, avoiding problematic solution binarization steps.

IEEE ROBOTICS AND AUTOMATION LETTERS (2023)

Article Robotics

Energy-Aware, Collision-Free Information Gathering for Heterogeneous Robot Teams

Xiaoyi Cai, Brent Schlotfeldt, Kasra Khosoussi, Nikolay Atanasov, George J. Pappas, Jonathan P. How

Summary: This article addresses the problem of coordinating sensor-equipped robots in a safe manner to reduce uncertainty in a dynamical process, considering the tradeoff between information gain and energy cost. Existing multirobot planners based on coordinate descent fail to provide performance guarantees due to the nonmonotone objective function in robot trajectories. Methods that handle nonmonotonicity also lose their performance guarantees when collision avoidance constraints are imposed. To achieve both performance and safety guarantees, this work proposes a hierarchical approach that combines a distributed planner with worst-case performance guarantees and a decentralized controller based on control barrier functions. Extensive simulations, hardware-in-the-loop tests, and hardware experiments demonstrate that the proposed approach achieves a better tradeoff between sensing and energy cost compared to coordinate-descent-based algorithms.

IEEE TRANSACTIONS ON ROBOTICS (2023)

Article Computer Science, Information Systems

PANTHER: Perception-Aware Trajectory Planner in Dynamic Environments

Jesus Tordesillas, Jonathan P. How

Summary: This paper presents PANTHER, a real-time perception-aware trajectory planner for multirotor-UAVs in dynamic environments. PANTHER plans trajectories that avoid dynamic obstacles while keeping them in the sensor field of view and minimizing blur for object tracking. The joint optimization of UAV rotation and translation allows PANTHER to fully exploit the differential flatness of multirotors. The experiments show that PANTHER outperforms existing methods in multi-obstacle avoidance scenarios.

IEEE ACCESS (2022)

Article Computer Science, Information Systems

Communication-Aware Consensus-Based Decentralized Task Allocation in Communication Constrained Environments

Sharan Raja, Golnaz Habibi, Jonathan P. How

Summary: This paper introduces a deep reinforcement learning framework, CA-CBBA, for task allocation in environments with limited bandwidth and message collisions. By learning communication strategies, this approach significantly improves task allocation performance and outperforms baseline algorithms in various scenarios.

IEEE ACCESS (2022)

Article Automation & Control Systems

Robustness Analysis of Neural Networks via Efficient Partitioning With Applications in Control Systems

Michael Everett, Golnaz Habibi, Jonathan P. How

Summary: Neural networks are commonly used in uncertain environments, but there is a lack of tools for formally analyzing the uncertainty in their outputs. Recent works have attempted to approximate the propagation of uncertainty through nonlinear activations, but this has led to excessive conservatism and slow computation speeds. This letter proposes a unified approach that combines propagation and partition methods to provide tighter bounds on neural network outputs.

IEEE CONTROL SYSTEMS LETTERS (2021)

Article Computer Science, Information Systems

Collision Avoidance in Pedestrian-Rich Environments With Deep Reinforcement Learning

Michael Everett, Yu Fan Chen, Jonathan P. How

Summary: This work introduces a deep reinforcement learning algorithm to enable robots to avoid collisions with pedestrians and other agents, even in heterogeneous and non-communicative environments. By leveraging Long Short-Term Memory strategy, the algorithm can adapt to varying scenarios and observe a larger number of agents, rather than just a fixed number of neighbors.

IEEE ACCESS (2021)

No Data Available