{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_3f788ae8d1462a5c675cfb47cb30fb80fab07dae69af30be9d78c312e758273f","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_3f788ae8d1462a5c675cfb47cb30fb80fab07dae69af30be9d78c312e758273f","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"09d139845f7f1f4ab44d771bfa31886be9755ed96d92b1ae1c6008701dc2c1a0","published":"Thu, 02 Jul 2026 00:00:00 -0400","receipt_hash":"09d139845f7f1f4ab44d771bfa31886be9755ed96d92b1ae1c6008701dc2c1a0","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"09d139845f7f1f4ab44d771bfa31886be9755ed96d92b1ae1c6008701dc2c1a0","observed_at":"2026-07-02T04:43:28.872255Z","parent_run_hash":"9f528c2a80e5b201c2a66ae885c05dd596ad2c3532bb4c6809c7c9704d10e650","published":"Thu, 02 Jul 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2607.00065v1 Announce Type: cross \nAbstract: Any-angle path planning extends traditional graph-based path planning by allowing movement between any pair of vertices, rather than being restricted by predefined edges. It can find straighter and shorter paths in continuous space with graphs, making it particularly suitable for navigation in open areas such as airspaces, warehouses, and oceans. Many any-angle path-planning algorithms have been proposed, but only a few can guarantee optimal solutions, especially in the presence of dynamic obstacles. To address this challenge, this article focuses on optimal any-angle path planning on grids and introduces two general techniques that accelerate computation while preserving optimality in both static and dynamic environments: 1) elliptical forward expansion, which leverages ellipse-based neighborhoods to restrict the search space, and 2) field of view, which replaces traditional line-of-sight methods to speed up visibility checks. To inte","title":"Optimal any-angle path planning in static and dynamic environments","url":"https://arxiv.org/abs/2607.00065","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.00065v1 Announce Type: cross \nAbstract: Any-angle path planning extends traditional graph-based path planning by allowing movement between any pair of vertices, rather than being restricted by predefined edges. It can find straighter and shorter paths in continuous space with graphs, making it particularly suitable for navigation in open areas such as airspaces, warehouses, and oceans. Many any-angle path-planning algorithms have been proposed, but only a few can guarantee optimal solutions, especially in the presence of dynamic obstacles. To address this challenge, this article focuses on optimal any-angle path planning on grids and introduces two general techniques that accelerate computation while preserving optimality in both static and dynamic environments: 1) elliptical forward expansion, which leverages ellipse-based neighborhoods to restrict the search space, and 2) field of view, which replaces traditional line-of-sight methods to speed up visibility checks. To inte","title":"Optimal any-angle path planning in static and dynamic environments","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-02T04:43:28Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.00065"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:283dfa855eecdde0ebc1a9c56db370fa67ec02b4334c3e1de84f9c9242051abbd9023988a42ae6c8fe307b75d7f5578aea274f7907b4f321d8f506cbcaf84a0f","signer":"crovia.substrate","subject":{"observed_at":"2026-07-02T04:43:28Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.00065"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"0f0928208b9f3e77222bdbb84d7e08f41405025c7421be5525615871f3dff36b","leaf_index":271974,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"d7f9111eccd2e147b826adbc039f8d85fdf1333780379d8ae34f6f585e834ac0","side":"right"},{"sibling":"9b2452b505012262e29ab109c5bcab67f9484b0f2643293a4ffc0db1c81f501b","side":"left"},{"sibling":"c57d791c5096a978985d99656719e21d0805eab89043958bad78c064767e1773","side":"left"},{"sibling":"fcef53ca75544ed190ce402dce415a70c9bb367ccae087e33bde1826e117e363","side":"right"},{"sibling":"f746b927d1f90ae3862bcf56b43ce81c1e825efaeba580cc981b9648dd555c28","side":"right"},{"sibling":"c25f18d33f4ad3f321fbcc471335c7d8875df72b3401ae191213309c57c4d3fb","side":"left"},{"sibling":"bba3920d4d73572ccae4aab47102490e036c6245a6d1cb8a6c5b92b702d7f20a","side":"left"},{"sibling":"245706846217c65709d33d0c2ef53806eee8ea674294e4e08c1d4f19cee09ac7","side":"right"},{"sibling":"155ae596a5c6a5260be50ff412642fbd25f4587b43e04c56950c1dc544719be1","side":"right"},{"sibling":"4cfdd7f7072619c015edc477162c2cf29c6f70370acb8dbddf1eb590876d82fe","side":"left"},{"sibling":"43990c9db8fcb3172d821965dfac69152981af4108b8dc87bd32f15c0e56f4cf","side":"left"},{"sibling":"15dbacc2e5845fe3bb835797bb7647ab6f091e79adadd39f40c636980716c622","side":"right"},{"sibling":"7ecc1d0d471643b88d886db58cb02a77af4d1495674760c3867834550b143757","side":"right"},{"sibling":"8a09562f6b247c1c3cd1fea36cb3b8f1cf5c575479dd514573856a380a964bf5","side":"left"},{"sibling":"7b681d50e7d0a7b8d2a749507aed58030072539a90fab18de4f698743685cc00","side":"right"},{"sibling":"9b262645232510ff15bb7325ab858256f2914f711d2726caeafd49f5ca0fb7a9","side":"right"},{"sibling":"5bd94446b5721b713c5e4dcf4624b9bc682657ab2784af927caae7b80c297d7d","side":"right"},{"sibling":"21ac0b7091fe1133859bcd17b4f8da2fe37a2489d472dad508305740b483221b","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":272319,"merkle_root":"dd4fa4deb1f207e8a7756821b4f940f39e9f06a25e6fa8500a21dd403318a5a7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260702T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-02T05:38:06Z","sig_algorithm":"ed25519","signature":"68eb2e3bbc0f593bea7b5c3c110c90b6f4fe4fd8277d8dee7c866ba0471c1a50684aa4539c8a493e6d9c9202d8c03f4d897a0df3477e9ecd5b0ff03eb1016f00","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_3f788ae8d1462a5c675cfb47cb30fb80fab07dae69af30be9d78c312e758273f"}}