Value-based subgoal discovery and path planning for reaching long-horizon goals
Learning to reach long-horizon goals in spatial traversal tasks is a significant challenge for autonomous agents. Recent subgoal graph-based planning methods address this challenge by decomposing a goal into a sequence of shorter-horizon subgoals. These methods, however, use arbitrary heuristics for...
Main Authors: | Pateria, Shubham, Subagdja, Budhitama, Tan, Ah-Hwee, Quek, Chai |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/170579 |
Similar Items
-
Strategy for robot motion and path planning in robot taping
by: Yuan, Qilong, et al.
Published: (2016) -
Dynamic path re-planning under emergency in very low level (VLL) complex urban airspace
by: Poh, Vanfled
Published: (2024) -
Exact Algorithms for the Canadian Traveller Problem on Paths and Trees
by: Karger, David, et al.
Published: (2008) -
Methods for autonomously decomposing and performing long-horizon sequential decision tasks
by: Pateria, Shubham
Published: (2022) -
Solving the Find-Path Problem by Representing Free Space as Generalized Cones
by: Brooks, Rodney A.
Published: (2004)