{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:43PRDTSB4CMOG3LK63IEG2YNBR","short_pith_number":"pith:43PRDTSB","schema_version":"1.0","canonical_sha256":"e6df11ce41e098e36d6af6d0436b0d0c40a32ee7c2a6553f625531f70d43f021","source":{"kind":"arxiv","id":"2608.17416","version":1},"attestation_state":"computed","paper":{"title":"Bi-Layer Ant Colony Optimization for Multi-Robot Task Allocation and Routing in Delivery Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Le Na Nguyen, Manh Duong Phung, Quan Le, Thanh Long Nguyen, Thanh Thao Ton Nu","submitted_at":"2026-08-18T06:36:20Z","abstract_excerpt":"This paper addresses the multi-robot task allocation (MRTA) problem, which is essential for delivery and logistics applications. Our approach first defines a new cost function that transforms the MRTA into a unified optimization problem capturing both task assignment and routing. A bi-layer ant colony optimization (ACO) algorithm is then introduced, integrating two interdependent decision layers within a single colony process to solve the problem. This hierarchical framework enables simultaneous optimization of task allocation and route planning across multiple robots. Comparative experiments "},"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":"2608.17416","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-08-18T06:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"96c1aca89770714433bba8b46bde3ce962f3578fa6a44e0ebe4af475bb5c5ecb","abstract_canon_sha256":"5a06336ecef21bb477aae73b8926660ae0344e046df327450d71e5144d0f7c6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-19T01:27:58.072017Z","signature_b64":"bnTyX06BTeyilQCPTn3SceU8atz71O4SVEPOusvwUSB6YwfZRoyyoXx9q1gLuS5R7kT4RoS6xcBppv+BKE83Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6df11ce41e098e36d6af6d0436b0d0c40a32ee7c2a6553f625531f70d43f021","last_reissued_at":"2026-08-19T01:27:58.069759Z","signature_status":"signed_v1","first_computed_at":"2026-08-19T01:27:58.069759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bi-Layer Ant Colony Optimization for Multi-Robot Task Allocation and Routing in Delivery Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Le Na Nguyen, Manh Duong Phung, Quan Le, Thanh Long Nguyen, Thanh Thao Ton Nu","submitted_at":"2026-08-18T06:36:20Z","abstract_excerpt":"This paper addresses the multi-robot task allocation (MRTA) problem, which is essential for delivery and logistics applications. Our approach first defines a new cost function that transforms the MRTA into a unified optimization problem capturing both task assignment and routing. A bi-layer ant colony optimization (ACO) algorithm is then introduced, integrating two interdependent decision layers within a single colony process to solve the problem. This hierarchical framework enables simultaneous optimization of task allocation and route planning across multiple robots. Comparative experiments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.17416","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/2608.17416/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":"2608.17416","created_at":"2026-08-19T01:27:58.072099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.17416v1","created_at":"2026-08-19T01:27:58.072099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.17416","created_at":"2026-08-19T01:27:58.072099+00:00"},{"alias_kind":"pith_short_12","alias_value":"43PRDTSB4CMO","created_at":"2026-08-19T01:27:58.072099+00:00"},{"alias_kind":"pith_short_16","alias_value":"43PRDTSB4CMOG3LK","created_at":"2026-08-19T01:27:58.072099+00:00"},{"alias_kind":"pith_short_8","alias_value":"43PRDTSB","created_at":"2026-08-19T01:27:58.072099+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/43PRDTSB4CMOG3LK63IEG2YNBR","json":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR.json","graph_json":"https://pith.science/api/pith-number/43PRDTSB4CMOG3LK63IEG2YNBR/graph.json","events_json":"https://pith.science/api/pith-number/43PRDTSB4CMOG3LK63IEG2YNBR/events.json","paper":"https://pith.science/paper/43PRDTSB"},"agent_actions":{"view_html":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR","download_json":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR.json","view_paper":"https://pith.science/paper/43PRDTSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.17416&json=true","fetch_graph":"https://pith.science/api/pith-number/43PRDTSB4CMOG3LK63IEG2YNBR/graph.json","fetch_events":"https://pith.science/api/pith-number/43PRDTSB4CMOG3LK63IEG2YNBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR/action/storage_attestation","attest_author":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR/action/author_attestation","sign_citation":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR/action/citation_signature","submit_replication":"https://pith.science/pith/43PRDTSB4CMOG3LK63IEG2YNBR/action/replication_record"}},"created_at":"2026-08-19T01:27:58.072099+00:00","updated_at":"2026-08-19T01:27:58.072099+00:00"}