Autonomous WiSAR
Autonomous Wilderness Search and Rescue (WiSAR)
The WiSAR problem of locating a lost person in the wilderness is one of the more challenging variants of the mobile-target search problem. In addition to the complexity of the problem, searching for people in the wilderness under tight time constraints is highly stressful for search and rescue personnel. The research described herein was performed with the aim of automating search to relieve SAR personnel of some of the stress while improving the probability of a successful search mission.
The research examined several approaches to addressing the WiSAR search problem including search with a static-sensor network and search with a mobile-static hybrid search team.
Static-Sensor Search
Static-sensor networks can cover a large geographical area at a relatively low cost. Despite this, they have been largely overlooked as an approach to mobile-target search. Part of this research into autonomous WiSAR looked into how static-sensor networks could be used in WiSAR. The work has resulted in a strategy for planning a static-sensor network deployment for effectively locating lost persons in a wilderness setting.
Figure Description:
An example search planned and carried out according to the developed static-sensor network deployment strategy. The search starts in (a) with a single sensor (blue dot) deployed some time after the target has left the target's last known position (LKP). In all figures, the target's path up to the current time is shown as a pink line. In (b) and (c), the search continues with further sensor deployments. In (d), a clue dropped by the target (green cross) is found by a separate mobile search (not shown). Shown in (e) is the re-planned deployment of sensors based on the new information. Shown in (f) is the target being found by one of the re-planned sensors later in the search.Select papers:
- A Dynamic Approach to Sensor Network Deployment for Mobile-Target Detection in Unstructured, Expanding Search Areas
- Spatiotemporal Adaptive Optimization of a Static-Sensor Network via a Non-Parametric Estimation of Target Location Likelihood
Mobile-Static Hybrid Search
Since static-sensors in the above work are assumed to be immobile, they need to be delivered to deployment locations by mobile-agents. Dedicating agents to the delivery of sensors, however, is an inefficient use of resources. This is especially true since the sensors in the above work have scheduled deployments. A more effective overall search can be achieved by having mobile-agents multitask, i.e., search for the target as they deliver sensors. This research into autonomous WiSAR continued with the investigation into how mobile and static searches could be used together. The work has resulted in the formulation of a novel variant of the vechile routing problem and a novel hybrid search planning strategy.
Figure Description:
Hybrid search planning begins with planning a dynamically deployed static-sensor network like the one shown in (a). Mobile-robot routes are then planned to visit sensors in a sequence. The sequence is optimized to maximize the amount of spare-time robtos have between sensor deployments. The sequence can be visualized as a route to be taken by robots to visit the sensors as shown in (b). Finally, paths are planned for robots to visit their assigned sensors. Between sensor deployments, in their spare time, robots search for the target in a way that maximizes the probability of target detection. An example path is shown in (c) for the robot taking the maroon route in (b).Select papers: