{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BZ65MUFJ4KJMSJTMG2TNAJKAUU","short_pith_number":"pith:BZ65MUFJ","schema_version":"1.0","canonical_sha256":"0e7dd650a9e292c9266c36a6d02540a51862740103e2c00f391cce7839f307b2","source":{"kind":"arxiv","id":"1902.01560","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Real-time Multimodal Routing with Hierarchical Hybrid Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Jacob P. Knickerbocker, Mykel J. Kochenderfer, Shushman Choudhury","submitted_at":"2019-02-05T06:03:18Z","abstract_excerpt":"We introduce the problem of Dynamic Real-time Multimodal Routing (DREAMR), which requires planning and executing routes under uncertainty for an autonomous agent. The agent has access to a time-varying transit vehicle network in which it can use multiple modes of transportation. For instance, a drone can either fly or ride on terrain vehicles for segments of their routes. DREAMR is a difficult problem of sequential decision making under uncertainty with both discrete and continuous variables. We design a novel hierarchical hybrid planning framework to solve the DREAMR problem that exploits its"},"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":"1902.01560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-05T06:03:18Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"d635d8ed72951df9ae352ecdb05a504191a107b5aac6781399f036a0b0e4bef6","abstract_canon_sha256":"0ce0fe0e73ffd15f3a5c1fc382f53f69f758ee3a8a3b07793946773c6911a3bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:01.931281Z","signature_b64":"XNQsk76M1hHQGu7a2QkdOwz/CvzvyqusH+sNETVDmZi/SyIbt8T2/OUp12Z+UmitK8Uy92zgXUR6xQ083Th2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e7dd650a9e292c9266c36a6d02540a51862740103e2c00f391cce7839f307b2","last_reissued_at":"2026-05-17T23:47:01.930567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:01.930567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Real-time Multimodal Routing with Hierarchical Hybrid Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Jacob P. Knickerbocker, Mykel J. Kochenderfer, Shushman Choudhury","submitted_at":"2019-02-05T06:03:18Z","abstract_excerpt":"We introduce the problem of Dynamic Real-time Multimodal Routing (DREAMR), which requires planning and executing routes under uncertainty for an autonomous agent. The agent has access to a time-varying transit vehicle network in which it can use multiple modes of transportation. For instance, a drone can either fly or ride on terrain vehicles for segments of their routes. DREAMR is a difficult problem of sequential decision making under uncertainty with both discrete and continuous variables. We design a novel hierarchical hybrid planning framework to solve the DREAMR problem that exploits its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01560","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":""},"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":"1902.01560","created_at":"2026-05-17T23:47:01.930704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01560v2","created_at":"2026-05-17T23:47:01.930704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01560","created_at":"2026-05-17T23:47:01.930704+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZ65MUFJ4KJM","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZ65MUFJ4KJMSJTM","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZ65MUFJ","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09094","citing_title":"Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU","json":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU.json","graph_json":"https://pith.science/api/pith-number/BZ65MUFJ4KJMSJTMG2TNAJKAUU/graph.json","events_json":"https://pith.science/api/pith-number/BZ65MUFJ4KJMSJTMG2TNAJKAUU/events.json","paper":"https://pith.science/paper/BZ65MUFJ"},"agent_actions":{"view_html":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU","download_json":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU.json","view_paper":"https://pith.science/paper/BZ65MUFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01560&json=true","fetch_graph":"https://pith.science/api/pith-number/BZ65MUFJ4KJMSJTMG2TNAJKAUU/graph.json","fetch_events":"https://pith.science/api/pith-number/BZ65MUFJ4KJMSJTMG2TNAJKAUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/action/storage_attestation","attest_author":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/action/author_attestation","sign_citation":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/action/citation_signature","submit_replication":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/action/replication_record"}},"created_at":"2026-05-17T23:47:01.930704+00:00","updated_at":"2026-05-17T23:47:01.930704+00:00"}