{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SJUCG2MAYEALZ65N5DSRW6HOUI","short_pith_number":"pith:SJUCG2MA","schema_version":"1.0","canonical_sha256":"9268236980c100bcfbade8e51b78eea21ab1fe90006b1f0662b64e24250d1d58","source":{"kind":"arxiv","id":"2508.13407","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Signal-Temporal-Logic-Based Task and Motion Planning of Bipedal Navigation using Benders Decomposition","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jiming Ren, Karen M. Feigh, Roman Mineyev, Samuel Coogan, Xuan Lin, Ye Zhao","submitted_at":"2025-08-18T23:58:22Z","abstract_excerpt":"Task and motion planning under Signal Temporal Logic constraints is known to be NP-hard. A common class of approaches formulates these hybrid problems, which involve discrete task scheduling and continuous motion planning, as mixed-integer programs (MIP). However, in applications for bipedal locomotion, introduction of non-convex constraints such as kinematic reachability and footstep rotation exacerbates the computational complexity of MIPs. In this work, we present a method based on Benders Decomposition to address scenarios where solving the entire monolithic optimization problem is prohibi"},"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":"2508.13407","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-18T23:58:22Z","cross_cats_sorted":[],"title_canon_sha256":"2324d5bd33b65e81392deb6800f7acf5b3f56aa3ef1c349c4944b50a5bb048ff","abstract_canon_sha256":"a93ff8d044b52af8dc6c4735d498c5c41956753722bbe8e5705444868643d2ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:23.469544Z","signature_b64":"jaV5cGwN9/PjzGDExVSHgZk6eK8xzi/DCWHJJaYnkELw8o5JRHb3hRLF7hhbX2lMuEYR7OHejfuzL7oAjZS3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9268236980c100bcfbade8e51b78eea21ab1fe90006b1f0662b64e24250d1d58","last_reissued_at":"2026-07-05T11:56:23.469055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:23.469055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Signal-Temporal-Logic-Based Task and Motion Planning of Bipedal Navigation using Benders Decomposition","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jiming Ren, Karen M. Feigh, Roman Mineyev, Samuel Coogan, Xuan Lin, Ye Zhao","submitted_at":"2025-08-18T23:58:22Z","abstract_excerpt":"Task and motion planning under Signal Temporal Logic constraints is known to be NP-hard. A common class of approaches formulates these hybrid problems, which involve discrete task scheduling and continuous motion planning, as mixed-integer programs (MIP). However, in applications for bipedal locomotion, introduction of non-convex constraints such as kinematic reachability and footstep rotation exacerbates the computational complexity of MIPs. In this work, we present a method based on Benders Decomposition to address scenarios where solving the entire monolithic optimization problem is prohibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13407","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/2508.13407/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":"2508.13407","created_at":"2026-07-05T11:56:23.469114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.13407v2","created_at":"2026-07-05T11:56:23.469114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13407","created_at":"2026-07-05T11:56:23.469114+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJUCG2MAYEAL","created_at":"2026-07-05T11:56:23.469114+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJUCG2MAYEALZ65N","created_at":"2026-07-05T11:56:23.469114+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJUCG2MA","created_at":"2026-07-05T11:56:23.469114+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.14063","citing_title":"Adaptive Obstacle-Aware Task Assignment and Planning for Heterogeneous Robot Teaming","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI","json":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI.json","graph_json":"https://pith.science/api/pith-number/SJUCG2MAYEALZ65N5DSRW6HOUI/graph.json","events_json":"https://pith.science/api/pith-number/SJUCG2MAYEALZ65N5DSRW6HOUI/events.json","paper":"https://pith.science/paper/SJUCG2MA"},"agent_actions":{"view_html":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI","download_json":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI.json","view_paper":"https://pith.science/paper/SJUCG2MA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.13407&json=true","fetch_graph":"https://pith.science/api/pith-number/SJUCG2MAYEALZ65N5DSRW6HOUI/graph.json","fetch_events":"https://pith.science/api/pith-number/SJUCG2MAYEALZ65N5DSRW6HOUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI/action/storage_attestation","attest_author":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI/action/author_attestation","sign_citation":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI/action/citation_signature","submit_replication":"https://pith.science/pith/SJUCG2MAYEALZ65N5DSRW6HOUI/action/replication_record"}},"created_at":"2026-07-05T11:56:23.469114+00:00","updated_at":"2026-07-05T11:56:23.469114+00:00"}