{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ILXVTHVDSG2GS4MHHNAEPNDDF2","short_pith_number":"pith:ILXVTHVD","schema_version":"1.0","canonical_sha256":"42ef599ea391b46971873b4047b4632e8dbc354c1761a07486a681a91429d648","source":{"kind":"arxiv","id":"2303.14737","version":1},"attestation_state":"computed","paper":{"title":"Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Mark Petersen, Russ Tedrake","submitted_at":"2023-03-26T14:37:06Z","abstract_excerpt":"One of the most difficult parts of motion planning in configuration space is ensuring a trajectory does not collide with task-space obstacles in the environment. Generating regions that are convex and collision free in configuration space can separate the computational burden of collision checking from motion planning. To that end, we propose an extension to IRIS (Iterative Regional Inflation by Semidefinite programming) [5] that allows it to operate in configuration space. Our algorithm, IRIS-NP (Iterative Regional Inflation by Semidefinite & Nonlinear Programming), uses nonlinear optimizatio"},"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":"2303.14737","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-03-26T14:37:06Z","cross_cats_sorted":[],"title_canon_sha256":"29e5137a20bee56b230ea888d0b8afe4f87810ff278db89361f27dce0f9e4224","abstract_canon_sha256":"6f38f742112a94f8b4413a38930838cfa6456f568b17dc09f620cb3c870aebfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:45.508507Z","signature_b64":"y9PJQbt90yrnfBxysjHArYaBNBrYFtFhMshLS723aN2iKcOZnlkQy3PiOVcEjeEQrVYaRv9wEj+9ICY8Ueq7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42ef599ea391b46971873b4047b4632e8dbc354c1761a07486a681a91429d648","last_reissued_at":"2026-07-05T05:54:45.508060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:45.508060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Mark Petersen, Russ Tedrake","submitted_at":"2023-03-26T14:37:06Z","abstract_excerpt":"One of the most difficult parts of motion planning in configuration space is ensuring a trajectory does not collide with task-space obstacles in the environment. Generating regions that are convex and collision free in configuration space can separate the computational burden of collision checking from motion planning. To that end, we propose an extension to IRIS (Iterative Regional Inflation by Semidefinite programming) [5] that allows it to operate in configuration space. Our algorithm, IRIS-NP (Iterative Regional Inflation by Semidefinite & Nonlinear Programming), uses nonlinear optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14737","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/2303.14737/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":"2303.14737","created_at":"2026-07-05T05:54:45.508118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.14737v1","created_at":"2026-07-05T05:54:45.508118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14737","created_at":"2026-07-05T05:54:45.508118+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILXVTHVDSG2G","created_at":"2026-07-05T05:54:45.508118+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILXVTHVDSG2GS4MH","created_at":"2026-07-05T05:54:45.508118+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILXVTHVD","created_at":"2026-07-05T05:54:45.508118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18516","citing_title":"Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2","json":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2.json","graph_json":"https://pith.science/api/pith-number/ILXVTHVDSG2GS4MHHNAEPNDDF2/graph.json","events_json":"https://pith.science/api/pith-number/ILXVTHVDSG2GS4MHHNAEPNDDF2/events.json","paper":"https://pith.science/paper/ILXVTHVD"},"agent_actions":{"view_html":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2","download_json":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2.json","view_paper":"https://pith.science/paper/ILXVTHVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.14737&json=true","fetch_graph":"https://pith.science/api/pith-number/ILXVTHVDSG2GS4MHHNAEPNDDF2/graph.json","fetch_events":"https://pith.science/api/pith-number/ILXVTHVDSG2GS4MHHNAEPNDDF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2/action/storage_attestation","attest_author":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2/action/author_attestation","sign_citation":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2/action/citation_signature","submit_replication":"https://pith.science/pith/ILXVTHVDSG2GS4MHHNAEPNDDF2/action/replication_record"}},"created_at":"2026-07-05T05:54:45.508118+00:00","updated_at":"2026-07-05T05:54:45.508118+00:00"}