Dynamic event-triggered integrated task and motion planning for process-aware source seeking

Abstract The process-aware source seeking (PASS) problem in flow fields aims to find an informative trajectory to reach an unknown source location while taking the energy consumption in the flow fields into consideration. Taking advantage of the dynamic flow field partition technique, this paper formulates this problem as a task and motion planning (TAMP) problem and proposes a bi-level hierarchical planning framework to decouple the planning of inter-region transition and inner-region trajectory by introducing inter-region junctions. An integrated strategy is developed to enable efficient upper-level planning by investigating the optimal solution of the lower-level planner. In order to leverage the information acquisition and computational burden, a dynamic event-triggered mechanism is introduced to enable asynchronized estimation, region partitioning and re-plans. The proposed algorithm provides guaranteed convergence of the trajectory, and achieves automatic trade-offs of both exploration-exploitation and accuracy-efficiency. Simulations in a highly complicated and realistic ocean surface flow field validate the merits of the proposed algorithm, which demonstrates a significant reduction in computational burden without compromising planning optimality.

Authors

Institutions

Publication Details

Journal
Autonomous Robots
Published
2024-10-12
DOI
https://doi.org/10.1007/s10514-024-10177-1
Primary Topic
Insect Pheromone Research and Control
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic event-triggered integrated task and motion planning for process-aware source seeking

Mengxue Hou, Fumin Zhang, Enlu Zhou, Yingke Li
Autonomous Robots
Insect Pheromone Research and Control
article

Dynamic event-triggered integrated task and motion planning for process-aware source seeking

Mengxue Hou, Fumin Zhang, Enlu Zhou, Yingke Li
article en

Abstract

Abstract The process-aware source seeking (PASS) problem in flow fields aims to find an informative trajectory to reach an unknown source location while taking the energy consumption in the flow fields into consideration. Taking advantage of the dynamic flow field partition technique, this paper formulates this problem as a task and motion planning (TAMP) problem and proposes a bi-level hierarchical planning framework to decouple the planning of inter-region transition and inner-region trajectory by introducing inter-region junctions. An integrated strategy is developed to enable efficient upper-level planning by investigating the optimal solution of the lower-level planner. In order to leverage the information acquisition and computational burden, a dynamic event-triggered mechanism is introduced to enable asynchronized estimation, region partitioning and re-plans. The proposed algorithm provides guaranteed convergence of the trajectory, and achieves automatic trade-offs of both exploration-exploitation and accuracy-efficiency. Simulations in a highly complicated and realistic ocean surface flow field validate the merits of the proposed algorithm, which demonstrates a significant reduction in computational burden without compromising planning optimality.

Autonomous RobotsVol. 48(8)
University of Notre Dame (US), Georgia Institute of Technology (US), Hong Kong University of Science and Technology (HK), American Institute of Aeronautics and Astronautics (US), Massachusetts Institute of Technology (US)
Hong Kong University of Science and Technology
Affordable and clean energy
Openalex Percentile: Top 87%
Insect Pheromone Research and Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.