{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:V5BLBVZR425TMSA7DJ5EQCEFA4","short_pith_number":"pith:V5BLBVZR","schema_version":"1.0","canonical_sha256":"af42b0d731e6bb36481f1a7a480885073184a3c392a08392858f81293166d938","source":{"kind":"arxiv","id":"2504.13372","version":2},"attestation_state":"computed","paper":{"title":"Integration of a Graph-Based Path Planner and Mixed-Integer MPC for Robot Navigation in Cluttered Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrew F. Thompson, Herschel C. Pangborn, Joshua A. Robbins, Sean Brennan, Stephen J. Harnett","submitted_at":"2025-04-17T22:42:03Z","abstract_excerpt":"The ability to update a path plan is a required capability for autonomous mobile robots navigating through uncertain environments. This paper proposes a re-planning strategy using a multilayer planning and control framework for cases where the robot's environment is partially known. A medial axis graph-based planner defines a global path plan based on known obstacles, where each edge in the graph corresponds to a unique corridor. A mixed-integer model predictive control (MPC) method detects if a terminal constraint derived from the global plan is infeasible, subject to a non-convex description"},"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":"2504.13372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-04-17T22:42:03Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"e81446f3d1ad4427bbde79cbb066ea98dd2d2a8fbda808599bcdfea9854bb621","abstract_canon_sha256":"d4d5588daafdba3153cdf07b4f15cf170ec9dc6a24c52c0d6eed12ac240b1ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:11.241767Z","signature_b64":"hwM8E3n6dFQzjci4n7NIMwUfgxPea/FtZ4hHvCjNymfgeXQNS0xX4IYBqoto6oE6PYZqRUfKdMfqW+mcn+vxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af42b0d731e6bb36481f1a7a480885073184a3c392a08392858f81293166d938","last_reissued_at":"2026-07-05T11:43:11.241277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:11.241277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integration of a Graph-Based Path Planner and Mixed-Integer MPC for Robot Navigation in Cluttered Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrew F. Thompson, Herschel C. Pangborn, Joshua A. Robbins, Sean Brennan, Stephen J. Harnett","submitted_at":"2025-04-17T22:42:03Z","abstract_excerpt":"The ability to update a path plan is a required capability for autonomous mobile robots navigating through uncertain environments. This paper proposes a re-planning strategy using a multilayer planning and control framework for cases where the robot's environment is partially known. A medial axis graph-based planner defines a global path plan based on known obstacles, where each edge in the graph corresponds to a unique corridor. A mixed-integer model predictive control (MPC) method detects if a terminal constraint derived from the global plan is infeasible, subject to a non-convex description"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.13372","kind":"arxiv","version":2},"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/2504.13372/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":"2504.13372","created_at":"2026-07-05T11:43:11.241336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.13372v2","created_at":"2026-07-05T11:43:11.241336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.13372","created_at":"2026-07-05T11:43:11.241336+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5BLBVZR425T","created_at":"2026-07-05T11:43:11.241336+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5BLBVZR425TMSA7","created_at":"2026-07-05T11:43:11.241336+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5BLBVZR","created_at":"2026-07-05T11:43:11.241336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4","json":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4.json","graph_json":"https://pith.science/api/pith-number/V5BLBVZR425TMSA7DJ5EQCEFA4/graph.json","events_json":"https://pith.science/api/pith-number/V5BLBVZR425TMSA7DJ5EQCEFA4/events.json","paper":"https://pith.science/paper/V5BLBVZR"},"agent_actions":{"view_html":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4","download_json":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4.json","view_paper":"https://pith.science/paper/V5BLBVZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.13372&json=true","fetch_graph":"https://pith.science/api/pith-number/V5BLBVZR425TMSA7DJ5EQCEFA4/graph.json","fetch_events":"https://pith.science/api/pith-number/V5BLBVZR425TMSA7DJ5EQCEFA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4/action/storage_attestation","attest_author":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4/action/author_attestation","sign_citation":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4/action/citation_signature","submit_replication":"https://pith.science/pith/V5BLBVZR425TMSA7DJ5EQCEFA4/action/replication_record"}},"created_at":"2026-07-05T11:43:11.241336+00:00","updated_at":"2026-07-05T11:43:11.241336+00:00"}