NASA NTRS · 20210010277
The source did not provide an abstract. Follow the original record for more information.
Explore connections, maps & timelines
John R Cooper. Multi-Agent Search and Rescue Using Potential Field Theory. https://ntrs.nasa.gov/citations/20210010277
Cite the original work for its findings. Save a collection to share your selection of sources.
KEEP EXPLORING
This paper presents a method for evaluating the amount of clutter in a region where autonomous vehicles in a multi-agent system must operate based on LIDAR point cloud measurements. The point cloud is used to generate an occupancy grid which is then projected onto a 2D plane of vehicle motion, constituting an image. A series of Gaussian radial basis functions (GRBFs) is created, each centered at an occupied pixel in a 2D image, and summed together to form the clutter field. The clutter field is a representation of the density and permeability of the space at each coordinate. The clutter field is then approximated such that iso-clutter contours are simple geometric objects so that intelligent machine assets can easily query the distance between them and any given point in an environment. In this way, agents are able to determine whether to enter into or steer away from areas of interest. Each vehicle has a clutter threshold representing the clutter value of the space in which it can safely maneuver. The iso-clutter contour corresponding to a vehicle’s clutter threshold is treated as the boundary of an obstacle to be avoided. A simulation is presented where a multi-agent system is tasked with persistent observation of a cluttered area. Each vehicle in the simulation has a different clutter threshold. The vehicles use a potential field-based guidance algorithm, and an allocation of vehicles to specific regions of the space emerges.
This paper presents an algorithm for efficient search and rescue using a multi-agent system of vehicles. The algorithm uses an artificial potential field combined with a time-varying reward function for visiting various points within the search area. The reward function is used as a weight for the attractiveness of these points in the potential field. The reward value increases while the point is not being observed, and decreases while the point is observed. Collision avoidance terms are used to repel vehicles from each other, which has the additional effect of reducing duplication of searching efforts. Gradient descent of the potential field results in persistent surveillance of the search area. The algorithm generates position commands in real-time based on communication with the other vehicles. This framework allows vehicles to react in a dynamic environment, which is a significant advantage to simply following a-priori defined trajectories. The algorithm is applied to a swarm of ground robots, and experimental data is presented showing that the swarm effectively searches the entire area and self-allocates search regions to individual vehicles.