An agent that plans on a landmark graph built from a locally accurate value function reaches long-range goals faster and more reliably than model-free baselines in sparse-reward environments.
Towards Learning Abstract Representations for Locomotion Planning in High-dimensional State Spaces
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Ground robots which are able to navigate a variety of terrains are needed in many domains. One of the key aspects is the capability to adapt to the ground structure, which can be realized through movable body parts coming along with additional degrees of freedom (DoF). However, planning respective locomotion is challenging since suitable representations result in large state spaces. Employing an additional abstract representation---which is coarser, lower-dimensional, and semantically enriched---can support the planning. While a desired robot representation and action set of such an abstract representation can be easily defined, the cost function requires large tuning efforts. We propose a method to represent the cost function as a CNN. Training of the network is done on generated artificial data, while it generalizes well to the abstraction of real world scenes. We further apply our method to the problem of search-based planning of hybrid driving-stepping locomotion. The abstract representation is used as a powerful informed heuristic which accelerates planning by multiple orders of magnitude.
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Mapping State Space using Landmarks for Universal Goal Reaching
An agent that plans on a landmark graph built from a locally accurate value function reaches long-range goals faster and more reliably than model-free baselines in sparse-reward environments.