{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DYQGLIOBONXVPRSMMUDS2PGBQ3","short_pith_number":"pith:DYQGLIOB","schema_version":"1.0","canonical_sha256":"1e2065a1c1736f57c64c65072d3cc186fd069d46e30641a5bae040d071ba2091","source":{"kind":"arxiv","id":"2203.05390","version":2},"attestation_state":"computed","paper":{"title":"Sequence-of-Constraints MPC: Reactive Timing-Optimal Control of Sequential Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Danny Driess, Jason Harris, Jung-Su Ha, Marc Toussaint, Wolfgang H\\\"onig","submitted_at":"2022-03-10T14:30:12Z","abstract_excerpt":"Task and Motion Planning has made great progress in solving hard sequential manipulation problems. However, a gap between such planning formulations and control methods for reactive execution remains. In this paper we propose a model predictive control approach dedicated to robustly execute a single sequence of constraints, which corresponds to a discrete decision sequence of a TAMP plan. We decompose the overall control problem into three sub-problems (solving for sequential waypoints, their timing, and a short receding horizon path) that each is a non-linear program solved online in each MPC"},"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":"2203.05390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-03-10T14:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"3e0774c0677469986101e323a0ee7bf5b532d2bd97934e455120aedd7b313525","abstract_canon_sha256":"78fbfb4f543b9989d6ce57e98a80904e3aa916d24202f9604ea3366236d5023c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:59:59.507198Z","signature_b64":"gzxcywrljZx6ggcR0SeiXE7XN4oVPmzHQyvMgXf7d0EWetmXmTJpm4xhVdNTLEb24/QuzlUOskZ6o1P1pxLMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e2065a1c1736f57c64c65072d3cc186fd069d46e30641a5bae040d071ba2091","last_reissued_at":"2026-07-05T04:59:59.506733Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:59:59.506733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequence-of-Constraints MPC: Reactive Timing-Optimal Control of Sequential Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Danny Driess, Jason Harris, Jung-Su Ha, Marc Toussaint, Wolfgang H\\\"onig","submitted_at":"2022-03-10T14:30:12Z","abstract_excerpt":"Task and Motion Planning has made great progress in solving hard sequential manipulation problems. However, a gap between such planning formulations and control methods for reactive execution remains. In this paper we propose a model predictive control approach dedicated to robustly execute a single sequence of constraints, which corresponds to a discrete decision sequence of a TAMP plan. We decompose the overall control problem into three sub-problems (solving for sequential waypoints, their timing, and a short receding horizon path) that each is a non-linear program solved online in each MPC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05390","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/2203.05390/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":"2203.05390","created_at":"2026-07-05T04:59:59.506788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.05390v2","created_at":"2026-07-05T04:59:59.506788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05390","created_at":"2026-07-05T04:59:59.506788+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYQGLIOBONXV","created_at":"2026-07-05T04:59:59.506788+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYQGLIOBONXVPRSM","created_at":"2026-07-05T04:59:59.506788+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYQGLIOB","created_at":"2026-07-05T04:59:59.506788+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.16555","citing_title":"An Optimization-Augmented Control Framework for Single and Coordinated Multi-Arm Robotic Manipulation","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3","json":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3.json","graph_json":"https://pith.science/api/pith-number/DYQGLIOBONXVPRSMMUDS2PGBQ3/graph.json","events_json":"https://pith.science/api/pith-number/DYQGLIOBONXVPRSMMUDS2PGBQ3/events.json","paper":"https://pith.science/paper/DYQGLIOB"},"agent_actions":{"view_html":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3","download_json":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3.json","view_paper":"https://pith.science/paper/DYQGLIOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.05390&json=true","fetch_graph":"https://pith.science/api/pith-number/DYQGLIOBONXVPRSMMUDS2PGBQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/DYQGLIOBONXVPRSMMUDS2PGBQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3/action/storage_attestation","attest_author":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3/action/author_attestation","sign_citation":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3/action/citation_signature","submit_replication":"https://pith.science/pith/DYQGLIOBONXVPRSMMUDS2PGBQ3/action/replication_record"}},"created_at":"2026-07-05T04:59:59.506788+00:00","updated_at":"2026-07-05T04:59:59.506788+00:00"}