Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Topological path planning for autonomous information gathering

Topological path planning for autonomous information gathering In this paper, we present two novel algorithms for information space topological planning that identify topological features in an information field and use them to plan maximally informative paths for a robot in an information gathering task. These features provide a way to rapidly incorporate global context into the informative path planning process by partitioning the state space or the path space of a robot. Our first algorithm, hierarchical hotspot information gathering, uses a topological state space partitioning by constructing a high-level map of information hotspots. We then solve a global scheduling problem over the topological graph, the solution of which is then used for path planning by a set of local greedy coverage planners within each hotspot. Our second algorithm, Topology-Aware Self Organizing Maps, extends the Self Organizing Map algorithm to discover prominent topological features in the information function. These features are used to perform a topological path space decomposition to provide a Stochastic Gradient Ascent optimization algorithm with topologically diverse initialization, improving its performance. In simulated trials and field experiments, we compare the tradeoffs of these two approaches and show that our methods that leverage topological features of the information field consistently perform competitively or better than methods that do not exploit these features, while requiring less computation time. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Autonomous Robots Springer Journals

Topological path planning for autonomous information gathering

McCammon, Seth; Hollinger, Geoffrey A.
Autonomous Robots , Volume 45 (6) – Sep 1, 2021
Download PDF
22 pages

Loading next page...
 
/lp/springer-journals/topological-path-planning-for-autonomous-information-gathering-vDmGoTB6nw

References (62)

Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021
ISSN
0929-5593
eISSN
1573-7527
DOI
10.1007/s10514-021-10012-x
Publisher site
See Article on Publisher Site

Abstract

In this paper, we present two novel algorithms for information space topological planning that identify topological features in an information field and use them to plan maximally informative paths for a robot in an information gathering task. These features provide a way to rapidly incorporate global context into the informative path planning process by partitioning the state space or the path space of a robot. Our first algorithm, hierarchical hotspot information gathering, uses a topological state space partitioning by constructing a high-level map of information hotspots. We then solve a global scheduling problem over the topological graph, the solution of which is then used for path planning by a set of local greedy coverage planners within each hotspot. Our second algorithm, Topology-Aware Self Organizing Maps, extends the Self Organizing Map algorithm to discover prominent topological features in the information function. These features are used to perform a topological path space decomposition to provide a Stochastic Gradient Ascent optimization algorithm with topologically diverse initialization, improving its performance. In simulated trials and field experiments, we compare the tradeoffs of these two approaches and show that our methods that leverage topological features of the information field consistently perform competitively or better than methods that do not exploit these features, while requiring less computation time.

Journal

Autonomous Robots – Springer Journals

Published: Sep 1, 2021

Keywords: Informative path planning; Topological path planning; Field robotics; Environmental monitoring

There are no references for this article.