{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HVPXVGV4NJCMH5FWZG2HHSZFLI","short_pith_number":"pith:HVPXVGV4","schema_version":"1.0","canonical_sha256":"3d5f7a9abc6a44c3f4b6c9b473cb255a20bcfc67c8a169a9793a67598eccaae7","source":{"kind":"arxiv","id":"2109.10106","version":1},"attestation_state":"computed","paper":{"title":"Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Barbara Arbanas Ferreira, Stjepan Bogdan, Tamara Petrovi\\'c","submitted_at":"2021-09-21T11:36:11Z","abstract_excerpt":"In this paper, we propose a distributed multi-stage optimization method for planning complex missions for heterogeneous multi-robot teams. This class of problems involves tasks that can be executed in different ways and are associated with cross-schedule dependencies that constrain the schedules of the different robots in the system. The proposed approach involves a multi-objective heuristic search of the mission, represented as a hierarchical tree that defines the mission goal. This procedure outputs several favorable ways to fulfill the mission, which directly feed into the next stage of the"},"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":"2109.10106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-21T11:36:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"759fce9f2160a155d7904b088ab13b0ecfd69aa8d2e045bb3bea5d52a61f9afb","abstract_canon_sha256":"398b94a607fa5f29dd823a1c79e6acddf5f566fed2e58fe455a3e354ed2dae12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:58.177839Z","signature_b64":"DfVPxQLXaq8QNBf92HWMGyvzf07psVzazh51BgA5A/u2PEQqRgZen+RrC/WgysVWVnl50O9ihShR7OM/rrdFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d5f7a9abc6a44c3f4b6c9b473cb255a20bcfc67c8a169a9793a67598eccaae7","last_reissued_at":"2026-07-05T03:15:58.177470Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:58.177470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Barbara Arbanas Ferreira, Stjepan Bogdan, Tamara Petrovi\\'c","submitted_at":"2021-09-21T11:36:11Z","abstract_excerpt":"In this paper, we propose a distributed multi-stage optimization method for planning complex missions for heterogeneous multi-robot teams. This class of problems involves tasks that can be executed in different ways and are associated with cross-schedule dependencies that constrain the schedules of the different robots in the system. The proposed approach involves a multi-objective heuristic search of the mission, represented as a hierarchical tree that defines the mission goal. This procedure outputs several favorable ways to fulfill the mission, which directly feed into the next stage of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.10106","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/2109.10106/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":"2109.10106","created_at":"2026-07-05T03:15:58.177537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.10106v1","created_at":"2026-07-05T03:15:58.177537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.10106","created_at":"2026-07-05T03:15:58.177537+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVPXVGV4NJCM","created_at":"2026-07-05T03:15:58.177537+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVPXVGV4NJCMH5FW","created_at":"2026-07-05T03:15:58.177537+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVPXVGV4","created_at":"2026-07-05T03:15:58.177537+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/HVPXVGV4NJCMH5FWZG2HHSZFLI","json":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI.json","graph_json":"https://pith.science/api/pith-number/HVPXVGV4NJCMH5FWZG2HHSZFLI/graph.json","events_json":"https://pith.science/api/pith-number/HVPXVGV4NJCMH5FWZG2HHSZFLI/events.json","paper":"https://pith.science/paper/HVPXVGV4"},"agent_actions":{"view_html":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI","download_json":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI.json","view_paper":"https://pith.science/paper/HVPXVGV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.10106&json=true","fetch_graph":"https://pith.science/api/pith-number/HVPXVGV4NJCMH5FWZG2HHSZFLI/graph.json","fetch_events":"https://pith.science/api/pith-number/HVPXVGV4NJCMH5FWZG2HHSZFLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/action/storage_attestation","attest_author":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/action/author_attestation","sign_citation":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/action/citation_signature","submit_replication":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/action/replication_record"}},"created_at":"2026-07-05T03:15:58.177537+00:00","updated_at":"2026-07-05T03:15:58.177537+00:00"}