Vandermeulen, I., Groß, R. orcid.org/0000-0003-1826-1375 and Kolling, A. (Accepted: 2020) Sampling-based search for a semi-cooperative target. In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 25-29 Oct 2020, Las Vegas, NV, USA. . (In Press)
Abstract
Searching for a lost teammate is an important task for multirobot systems. We present a variant of rapidly expanding random trees (RRT) for generating search paths based on a probabilistic belief of the target teammate’s position. The belief is updated using a hidden Markov model built from knowledge of the target’s planned or historic behavior. For any candidate search path, this belief is used to compute a discounted reward which is a weighted sum of the connection probability at each time step. The RRT search algorithm uses randomly sampled locations to generate candidate vertices and adds candidate vertices to a planning tree based on bounds on the discounted reward. Candidate vertices are along the shortest path from an existing vertex to the sampled location, biasing the search based on the topology of the environment. This method produces high quality search paths which are not constrained to a grid and can be computed fast enough to be used in real time. Compared with two other strategies, it found the target significantly faster in the most difficult 60% of situations and was similar in the easier 40% of situations.
Metadata
Authors/Creators: |
|
---|---|
Copyright, Publisher and Additional Information: | © 2020 The Authors. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 28 Jul 2020 07:57 |
Last Modified: | 28 Jul 2020 07:57 |
Status: | In Press |
Refereed: | Yes |
Related URLs: |
Download
Filename: iros_2020.pdf
