{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EM5RRNNKPQ37P5LH2J2QCFDEUZ","short_pith_number":"pith:EM5RRNNK","schema_version":"1.0","canonical_sha256":"233b18b5aa7c37f7f567d275011464a65963fba280ed30843790e31d40a42938","source":{"kind":"arxiv","id":"2504.11823","version":1},"attestation_state":"computed","paper":{"title":"Multi-goal Rapidly Exploring Random Tree with Safety and Dynamic Constraints for UAV Cooperative Path Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Duy-Nam Bui, Hoa TT. Nguyen, Manh Duong Phung, Mien L. Trinh, Minh T. Nguyen, Thu Hang Khuat","submitted_at":"2025-04-16T07:16:35Z","abstract_excerpt":"Cooperative path planning is gaining its importance due to the increasing demand on using multiple unmanned aerial vehicles (UAVs) for complex missions. This work addresses the problem by introducing a new algorithm named MultiRRT that extends the rapidly exploring random tree (RRT) to generate paths for a group of UAVs to reach multiple goal locations at the same time. We first derive the dynamics constraint of the UAV and include it in the problem formulation. MultiRRT is then developed, taking into account the cooperative requirements and safe constraints during its path-searching process. "},"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":"2504.11823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-16T07:16:35Z","cross_cats_sorted":[],"title_canon_sha256":"8d2ebd54ce2d86db7437774178cc6b2bff65c0a30deebbe7f244f883c5566cfe","abstract_canon_sha256":"97023a433de02f8c101ef26abdcd8871b53435188c2346508435a91c5e556ee7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:58.284621Z","signature_b64":"hIleW2dWqjdb8RorKuuv2HGfnwCBQWPw6ShnLc1msh+uDHSCn8pi+qjonj37Qw8IYvG/2+V/7jODnkNO/zvSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"233b18b5aa7c37f7f567d275011464a65963fba280ed30843790e31d40a42938","last_reissued_at":"2026-07-05T10:49:58.284084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:58.284084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-goal Rapidly Exploring Random Tree with Safety and Dynamic Constraints for UAV Cooperative Path Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Duy-Nam Bui, Hoa TT. Nguyen, Manh Duong Phung, Mien L. Trinh, Minh T. Nguyen, Thu Hang Khuat","submitted_at":"2025-04-16T07:16:35Z","abstract_excerpt":"Cooperative path planning is gaining its importance due to the increasing demand on using multiple unmanned aerial vehicles (UAVs) for complex missions. This work addresses the problem by introducing a new algorithm named MultiRRT that extends the rapidly exploring random tree (RRT) to generate paths for a group of UAVs to reach multiple goal locations at the same time. We first derive the dynamics constraint of the UAV and include it in the problem formulation. MultiRRT is then developed, taking into account the cooperative requirements and safe constraints during its path-searching process. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11823","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/2504.11823/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":"2504.11823","created_at":"2026-07-05T10:49:58.284142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.11823v1","created_at":"2026-07-05T10:49:58.284142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11823","created_at":"2026-07-05T10:49:58.284142+00:00"},{"alias_kind":"pith_short_12","alias_value":"EM5RRNNKPQ37","created_at":"2026-07-05T10:49:58.284142+00:00"},{"alias_kind":"pith_short_16","alias_value":"EM5RRNNKPQ37P5LH","created_at":"2026-07-05T10:49:58.284142+00:00"},{"alias_kind":"pith_short_8","alias_value":"EM5RRNNK","created_at":"2026-07-05T10:49:58.284142+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/EM5RRNNKPQ37P5LH2J2QCFDEUZ","json":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ.json","graph_json":"https://pith.science/api/pith-number/EM5RRNNKPQ37P5LH2J2QCFDEUZ/graph.json","events_json":"https://pith.science/api/pith-number/EM5RRNNKPQ37P5LH2J2QCFDEUZ/events.json","paper":"https://pith.science/paper/EM5RRNNK"},"agent_actions":{"view_html":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ","download_json":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ.json","view_paper":"https://pith.science/paper/EM5RRNNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.11823&json=true","fetch_graph":"https://pith.science/api/pith-number/EM5RRNNKPQ37P5LH2J2QCFDEUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/EM5RRNNKPQ37P5LH2J2QCFDEUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ/action/storage_attestation","attest_author":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ/action/author_attestation","sign_citation":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ/action/citation_signature","submit_replication":"https://pith.science/pith/EM5RRNNKPQ37P5LH2J2QCFDEUZ/action/replication_record"}},"created_at":"2026-07-05T10:49:58.284142+00:00","updated_at":"2026-07-05T10:49:58.284142+00:00"}