Pith. sign in

REVIEW 1 cited by

Towards Learning Abstract Representations for Locomotion Planning in High-dimensional State Spaces

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.02308 v1 pith:4IYF5RRT submitted 2019-03-06 cs.RO

classification cs.RO
keywords planningabstractlocomotionrepresentationadditionalcostfunctionground
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mapping State Space using Landmarks for Universal Goal Reaching

    cs.LG 2019-08 conditional novelty 6.0 of 10

    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.

Pith tools