{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QE65X73Z5ZV2I2AEQXV7KQQZAI","short_pith_number":"pith:QE65X73Z","schema_version":"1.0","canonical_sha256":"813ddbff79ee6ba4680485ebf54219023f6d8b8c0a43238897c9c67bf1d223de","source":{"kind":"arxiv","id":"2401.06021","version":2},"attestation_state":"computed","paper":{"title":"Topology-Driven Parallel Trajectory Optimization in Dynamic Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dariu M. Gavrila, Javier Alonso-Mora, Laura Ferranti, Oscar de Groot","submitted_at":"2024-01-11T16:32:11Z","abstract_excerpt":"Ground robots navigating in complex, dynamic environments must compute collision-free trajectories to avoid obstacles safely and efficiently. Nonconvex optimization is a popular method to compute a trajectory in real-time. However, these methods often converge to locally optimal solutions and frequently switch between different local minima, leading to inefficient and unsafe robot motion. In this work, We propose a novel topology-driven trajectory optimization strategy for dynamic environments that plans multiple distinct evasive trajectories to enhance the robot's behavior and efficiency. A g"},"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.06021","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-11T16:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"00c20cc93c4745dfe3fea408d94364de140cd6be3f12aacd10ab63d4c25a9804","abstract_canon_sha256":"a6a4e3a42ace42464f3256463b19bdf49c135e8cabc7af1f2e76b401f31544cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:54.417398Z","signature_b64":"LuN8hZvfuKRDgPS2hMZowzpxyTDS57U8lQyqSwHovFKA/kV2jnUI1TogeAx13PieBhlWM0QHEMcr48ZH4HmIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"813ddbff79ee6ba4680485ebf54219023f6d8b8c0a43238897c9c67bf1d223de","last_reissued_at":"2026-07-05T09:15:54.416895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:54.416895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topology-Driven Parallel Trajectory Optimization in Dynamic Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dariu M. Gavrila, Javier Alonso-Mora, Laura Ferranti, Oscar de Groot","submitted_at":"2024-01-11T16:32:11Z","abstract_excerpt":"Ground robots navigating in complex, dynamic environments must compute collision-free trajectories to avoid obstacles safely and efficiently. Nonconvex optimization is a popular method to compute a trajectory in real-time. However, these methods often converge to locally optimal solutions and frequently switch between different local minima, leading to inefficient and unsafe robot motion. In this work, We propose a novel topology-driven trajectory optimization strategy for dynamic environments that plans multiple distinct evasive trajectories to enhance the robot's behavior and efficiency. A g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06021","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.06021/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.06021","created_at":"2026-07-05T09:15:54.416948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.06021v2","created_at":"2026-07-05T09:15:54.416948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06021","created_at":"2026-07-05T09:15:54.416948+00:00"},{"alias_kind":"pith_short_12","alias_value":"QE65X73Z5ZV2","created_at":"2026-07-05T09:15:54.416948+00:00"},{"alias_kind":"pith_short_16","alias_value":"QE65X73Z5ZV2I2AE","created_at":"2026-07-05T09:15:54.416948+00:00"},{"alias_kind":"pith_short_8","alias_value":"QE65X73Z","created_at":"2026-07-05T09:15:54.416948+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.22643","citing_title":"An Overtaking Trajectory Planning Framework Based on Spatio-temporal Topology and Reachable Set Analysis Ensuring Time Efficiency","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI","json":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI.json","graph_json":"https://pith.science/api/pith-number/QE65X73Z5ZV2I2AEQXV7KQQZAI/graph.json","events_json":"https://pith.science/api/pith-number/QE65X73Z5ZV2I2AEQXV7KQQZAI/events.json","paper":"https://pith.science/paper/QE65X73Z"},"agent_actions":{"view_html":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI","download_json":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI.json","view_paper":"https://pith.science/paper/QE65X73Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.06021&json=true","fetch_graph":"https://pith.science/api/pith-number/QE65X73Z5ZV2I2AEQXV7KQQZAI/graph.json","fetch_events":"https://pith.science/api/pith-number/QE65X73Z5ZV2I2AEQXV7KQQZAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/action/storage_attestation","attest_author":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/action/author_attestation","sign_citation":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/action/citation_signature","submit_replication":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/action/replication_record"}},"created_at":"2026-07-05T09:15:54.416948+00:00","updated_at":"2026-07-05T09:15:54.416948+00:00"}