{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IVISVPSLAZJ5BZVKIKKXMMHSY6","short_pith_number":"pith:IVISVPSL","schema_version":"1.0","canonical_sha256":"45512abe4b0653d0e6aa42957630f2c7ad540f5c5a1a51c00a4884666c65571f","source":{"kind":"arxiv","id":"2401.13078","version":2},"attestation_state":"computed","paper":{"title":"Open-Source, Cost-Aware Kinematically Feasible Planning for Mobile and Surface Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Joshua Wallace, Matthew Booker, Steve Macenski, Tobias Fischer","submitted_at":"2024-01-23T20:08:41Z","abstract_excerpt":"We present Smac Planner, an openly available, search-based planning framework that addresses the critical need for kinematically feasible path planning across diverse robot platforms. Smac Planner provides high-performance implementations of Cost-Aware A*, Hybrid-A*, and State Lattice planners that can be deployed for Ackermann, legged, and other large non-circular robots. Our framework introduces novel \"Cost-Aware\" variations that significantly improve performance in complex environments common to mobile robotics while maintaining kinematic feasibility constraints. Integrated as the standard "},"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":"2401.13078","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-23T20:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"ce16bbaed0bdcd849a1c94be7ee2f554dade97376d83070617ae30f9556268a6","abstract_canon_sha256":"ce49e4eba7c303c7506621667e76019cc5a86a29e364cbe07e96b637dedf722f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:36.200839Z","signature_b64":"1Ae0Ey42ym9sDTdW73+zdSFq8S3MQdHIXj8bROTItVIlwa5Qiy1qin43wVIWq0YIjN4KDBhmz3KXzmgAJA+5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45512abe4b0653d0e6aa42957630f2c7ad540f5c5a1a51c00a4884666c65571f","last_reissued_at":"2026-07-05T11:00:36.200300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:36.200300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Open-Source, Cost-Aware Kinematically Feasible Planning for Mobile and Surface Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Joshua Wallace, Matthew Booker, Steve Macenski, Tobias Fischer","submitted_at":"2024-01-23T20:08:41Z","abstract_excerpt":"We present Smac Planner, an openly available, search-based planning framework that addresses the critical need for kinematically feasible path planning across diverse robot platforms. Smac Planner provides high-performance implementations of Cost-Aware A*, Hybrid-A*, and State Lattice planners that can be deployed for Ackermann, legged, and other large non-circular robots. Our framework introduces novel \"Cost-Aware\" variations that significantly improve performance in complex environments common to mobile robotics while maintaining kinematic feasibility constraints. Integrated as the standard "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.13078","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/2401.13078/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":"2401.13078","created_at":"2026-07-05T11:00:36.200370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.13078v2","created_at":"2026-07-05T11:00:36.200370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13078","created_at":"2026-07-05T11:00:36.200370+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVISVPSLAZJ5","created_at":"2026-07-05T11:00:36.200370+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVISVPSLAZJ5BZVK","created_at":"2026-07-05T11:00:36.200370+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVISVPSL","created_at":"2026-07-05T11:00:36.200370+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17679","citing_title":"A Hamilton-Jacobi Reachability-Guided Search Framework for Efficient and Safe Indoor Planar Robot Navigation","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6","json":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6.json","graph_json":"https://pith.science/api/pith-number/IVISVPSLAZJ5BZVKIKKXMMHSY6/graph.json","events_json":"https://pith.science/api/pith-number/IVISVPSLAZJ5BZVKIKKXMMHSY6/events.json","paper":"https://pith.science/paper/IVISVPSL"},"agent_actions":{"view_html":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6","download_json":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6.json","view_paper":"https://pith.science/paper/IVISVPSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.13078&json=true","fetch_graph":"https://pith.science/api/pith-number/IVISVPSLAZJ5BZVKIKKXMMHSY6/graph.json","fetch_events":"https://pith.science/api/pith-number/IVISVPSLAZJ5BZVKIKKXMMHSY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6/action/storage_attestation","attest_author":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6/action/author_attestation","sign_citation":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6/action/citation_signature","submit_replication":"https://pith.science/pith/IVISVPSLAZJ5BZVKIKKXMMHSY6/action/replication_record"}},"created_at":"2026-07-05T11:00:36.200370+00:00","updated_at":"2026-07-05T11:00:36.200370+00:00"}