{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BFEXCWBKL544ELMHS5XKFS5WJI","short_pith_number":"pith:BFEXCWBK","schema_version":"1.0","canonical_sha256":"094971582a5f79c22d87976ea2cbb64a0ef7f16acf49a57db7150f4c1a36071c","source":{"kind":"arxiv","id":"1607.07472","version":1},"attestation_state":"computed","paper":{"title":"Efficient Multi-Agent Global Navigation Using Interpolating Bridges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dinesh Manocha, Jia Pan, Liang He","submitted_at":"2016-07-25T20:50:47Z","abstract_excerpt":"We present a novel approach for collision-free global navigation for continuous-time multi-agent systems with general linear dynamics. Our approach is general and can be used to perform collision-free navigation in 2D and 3D workspaces with narrow passages and crowded regions. As part of pre-computation, we compute multiple bridges in the narrow or tight regions in the workspace using kinodynamic RRT algorithms. Our bridge has certain geometric characteristics, that en- able us to calculate a collision-free trajectory for each agent using simple interpolation at runtime. Moreover, we combine i"},"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":"1607.07472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-25T20:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"615fbca2ad392b439b6a433987a5ab4cba47b9c8189cab273c0fa037ad228ef9","abstract_canon_sha256":"00d45e890c1148cacc318c73efef2b2af18b90a1dcf321ca2a8d64b8d6af64ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:37.665651Z","signature_b64":"XRvMpnh6kBmiR3hqibZluOASGsg2+uPdzyuYLQ/dTswlNYwALzFY9unaUDPwSEPgXIX4w/JLxqBjrdM+K8B0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"094971582a5f79c22d87976ea2cbb64a0ef7f16acf49a57db7150f4c1a36071c","last_reissued_at":"2026-05-18T01:03:37.665083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:37.665083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Multi-Agent Global Navigation Using Interpolating Bridges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dinesh Manocha, Jia Pan, Liang He","submitted_at":"2016-07-25T20:50:47Z","abstract_excerpt":"We present a novel approach for collision-free global navigation for continuous-time multi-agent systems with general linear dynamics. Our approach is general and can be used to perform collision-free navigation in 2D and 3D workspaces with narrow passages and crowded regions. As part of pre-computation, we compute multiple bridges in the narrow or tight regions in the workspace using kinodynamic RRT algorithms. Our bridge has certain geometric characteristics, that en- able us to calculate a collision-free trajectory for each agent using simple interpolation at runtime. Moreover, we combine i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07472","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":""},"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":"1607.07472","created_at":"2026-05-18T01:03:37.665161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07472v1","created_at":"2026-05-18T01:03:37.665161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07472","created_at":"2026-05-18T01:03:37.665161+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFEXCWBKL544","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFEXCWBKL544ELMH","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFEXCWBK","created_at":"2026-05-18T12:30:07.202191+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/BFEXCWBKL544ELMHS5XKFS5WJI","json":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI.json","graph_json":"https://pith.science/api/pith-number/BFEXCWBKL544ELMHS5XKFS5WJI/graph.json","events_json":"https://pith.science/api/pith-number/BFEXCWBKL544ELMHS5XKFS5WJI/events.json","paper":"https://pith.science/paper/BFEXCWBK"},"agent_actions":{"view_html":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI","download_json":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI.json","view_paper":"https://pith.science/paper/BFEXCWBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07472&json=true","fetch_graph":"https://pith.science/api/pith-number/BFEXCWBKL544ELMHS5XKFS5WJI/graph.json","fetch_events":"https://pith.science/api/pith-number/BFEXCWBKL544ELMHS5XKFS5WJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/action/storage_attestation","attest_author":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/action/author_attestation","sign_citation":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/action/citation_signature","submit_replication":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/action/replication_record"}},"created_at":"2026-05-18T01:03:37.665161+00:00","updated_at":"2026-05-18T01:03:37.665161+00:00"}