Pith. sign in

REVIEW 1 cited by

Toward Safety-Aware Informative Motion Planning for Legged Robots

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 2103.14252 v1 pith:P2A7R76C submitted 2021-03-26 cs.RO

classification cs.RO
keywords planninginformationmotioninformativeaccountalgorithmcbfsclosed-loop
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper reports on developing an integrated framework for safety-aware informative motion planning suitable for legged robots. The information-gathering planner takes a dense stochastic map of the environment into account, while safety constraints are enforced via Control Barrier Functions (CBFs). The planner is based on the Incrementally-exploring Information Gathering (IIG) algorithm and allows closed-loop kinodynamic node expansion using a Model Predictive Control (MPC) formalism. Robotic exploration and information gathering problems are inherently path-dependent problems. That is, the information collected along a path depends on the state and observation history. As such, motion planning solely based on a modular cost does not lead to suitable plans for exploration. We propose SAFE-IIG, an integrated informative motion planning algorithm that takes into account: 1) a robot's perceptual field of view via a submodular information function computed over a stochastic map of the environment, 2) a robot's dynamics and safety constraints via discrete-time CBFs and MPC for closed-loop multi-horizon node expansions, and 3) an automatic stopping criterion via setting an information-theoretic planning horizon. The simulation results show that SAFE-IIG can plan a safe and dynamically feasible path while exploring a dense map.

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. Max Entropy Moment Kalman Filter for Polynomial Systems with Arbitrary Noise

    cs.RO 2025-06 conditional novelty 6.0 of 10

    MEM-KF approximates the Bayes filter for polynomial systems by propagating moments and recovering max-entropy distributions, with point estimates extracted via semidefinite relaxation.

Pith tools