{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I27REMN24TQCRSKAWAMN4IAKQ4","short_pith_number":"pith:I27REMN2","schema_version":"1.0","canonical_sha256":"46bf1231bae4e028c940b018de200a873689b707f0146feae93812c82e9456b8","source":{"kind":"arxiv","id":"1703.07887","version":1},"attestation_state":"computed","paper":{"title":"Combining Neural Networks and Tree Search for Task and Motion Planning in Challenging Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chris Paxton, Gregory D. Hager, Marin Kobilarov, Vasumathi Raman","submitted_at":"2017-03-22T23:46:51Z","abstract_excerpt":"We consider task and motion planning in complex dynamic environments for problems expressed in terms of a set of Linear Temporal Logic (LTL) constraints, and a reward function. We propose a methodology based on reinforcement learning that employs deep neural networks to learn low-level control policies as well as task-level option policies. A major challenge in this setting, both for neural network approaches and classical planning, is the need to explore future worlds of a complex and interactive environment. To this end, we integrate Monte Carlo Tree Search with hierarchical neural net contr"},"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":"1703.07887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-22T23:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"e890c2cc67b99ec635989bd8dc6c6f80be1f9d5e57252f47bcfb55d4cdd9c984","abstract_canon_sha256":"6baf2e102684525098da8fcf3a829ada3712667d29b4903bb180d7bd43d56658"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.533081Z","signature_b64":"lmUdB4GwrWt7j8Y/7rMVM8REJ8We+s9q2YqDTqDr6BYbjJn8/r1TL+zjYep805ylioXi03DWqsr23QoWLupxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46bf1231bae4e028c940b018de200a873689b707f0146feae93812c82e9456b8","last_reissued_at":"2026-05-18T00:48:04.532365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.532365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Neural Networks and Tree Search for Task and Motion Planning in Challenging Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chris Paxton, Gregory D. Hager, Marin Kobilarov, Vasumathi Raman","submitted_at":"2017-03-22T23:46:51Z","abstract_excerpt":"We consider task and motion planning in complex dynamic environments for problems expressed in terms of a set of Linear Temporal Logic (LTL) constraints, and a reward function. We propose a methodology based on reinforcement learning that employs deep neural networks to learn low-level control policies as well as task-level option policies. A major challenge in this setting, both for neural network approaches and classical planning, is the need to explore future worlds of a complex and interactive environment. To this end, we integrate Monte Carlo Tree Search with hierarchical neural net contr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07887","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":""},"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":"1703.07887","created_at":"2026-05-18T00:48:04.532485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07887v1","created_at":"2026-05-18T00:48:04.532485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07887","created_at":"2026-05-18T00:48:04.532485+00:00"},{"alias_kind":"pith_short_12","alias_value":"I27REMN24TQC","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I27REMN24TQCRSKA","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I27REMN2","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10971","citing_title":"NeuroTrajectory: A Neuroevolutionary Approach to Local State Trajectory Learning for Autonomous Vehicles","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4","json":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4.json","graph_json":"https://pith.science/api/pith-number/I27REMN24TQCRSKAWAMN4IAKQ4/graph.json","events_json":"https://pith.science/api/pith-number/I27REMN24TQCRSKAWAMN4IAKQ4/events.json","paper":"https://pith.science/paper/I27REMN2"},"agent_actions":{"view_html":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4","download_json":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4.json","view_paper":"https://pith.science/paper/I27REMN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07887&json=true","fetch_graph":"https://pith.science/api/pith-number/I27REMN24TQCRSKAWAMN4IAKQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/I27REMN24TQCRSKAWAMN4IAKQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4/action/storage_attestation","attest_author":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4/action/author_attestation","sign_citation":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4/action/citation_signature","submit_replication":"https://pith.science/pith/I27REMN24TQCRSKAWAMN4IAKQ4/action/replication_record"}},"created_at":"2026-05-18T00:48:04.532485+00:00","updated_at":"2026-05-18T00:48:04.532485+00:00"}