{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:P2A7R76CKDOZXA5HN3NFZX6VXQ","short_pith_number":"pith:P2A7R76C","schema_version":"1.0","canonical_sha256":"7e81f8ffc250dd9b83a76eda5cdfd5bc0f13f4bbd80134d3d88400e081ece81d","source":{"kind":"arxiv","id":"2103.14252","version":1},"attestation_state":"computed","paper":{"title":"Toward Safety-Aware Informative Motion Planning for Legged Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jessy W. Grizzle, Maani Ghaffari, Sangli Teng, Yukai Gong","submitted_at":"2021-03-26T04:29:18Z","abstract_excerpt":"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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2103.14252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-26T04:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"d860e28448b885d3959743e828a789af806fc1f6099986945062da182d49c383","abstract_canon_sha256":"b232de02d7d727d78fb02acd20847c6b286387e9b93a1f4f1239cc2aa1b9a2fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:31.959968Z","signature_b64":"3DjRKC0+o/8r8mjiICrsaRb12fnOJK04ClNwmwUUn94WqPEvqR0ugdrwtQB62TTEZy1t49ajAr/88iSBdv+MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e81f8ffc250dd9b83a76eda5cdfd5bc0f13f4bbd80134d3d88400e081ece81d","last_reissued_at":"2026-07-05T02:26:31.959483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:31.959483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Safety-Aware Informative Motion Planning for Legged Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jessy W. Grizzle, Maani Ghaffari, Sangli Teng, Yukai Gong","submitted_at":"2021-03-26T04:29:18Z","abstract_excerpt":"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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14252","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.14252/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2103.14252","created_at":"2026-07-05T02:26:31.959538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.14252v1","created_at":"2026-07-05T02:26:31.959538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14252","created_at":"2026-07-05T02:26:31.959538+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2A7R76CKDOZ","created_at":"2026-07-05T02:26:31.959538+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2A7R76CKDOZXA5H","created_at":"2026-07-05T02:26:31.959538+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2A7R76C","created_at":"2026-07-05T02:26:31.959538+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10579","citing_title":"LieIPM: Lie Group Interior Point Method for Direct Trajectory Optimization of Rigid Bodies","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10596","citing_title":"Embedding Hybrid Systems into Continuous Latent Vector Fields","ref_index":93,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ","json":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ.json","graph_json":"https://pith.science/api/pith-number/P2A7R76CKDOZXA5HN3NFZX6VXQ/graph.json","events_json":"https://pith.science/api/pith-number/P2A7R76CKDOZXA5HN3NFZX6VXQ/events.json","paper":"https://pith.science/paper/P2A7R76C"},"agent_actions":{"view_html":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ","download_json":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ.json","view_paper":"https://pith.science/paper/P2A7R76C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.14252&json=true","fetch_graph":"https://pith.science/api/pith-number/P2A7R76CKDOZXA5HN3NFZX6VXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/P2A7R76CKDOZXA5HN3NFZX6VXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ/action/storage_attestation","attest_author":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ/action/author_attestation","sign_citation":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ/action/citation_signature","submit_replication":"https://pith.science/pith/P2A7R76CKDOZXA5HN3NFZX6VXQ/action/replication_record"}},"created_at":"2026-07-05T02:26:31.959538+00:00","updated_at":"2026-07-05T02:26:31.959538+00:00"}