{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/strips-planning-in-infinite-domains","title":"STRIPS Planning in Infinite Domains","arxiv_id":"1701.00287","date":"2017-01-01","proceeding":null,"authors":["Caelan Reed Garrett","Tomás Lozano-Pérez","Leslie Pack Kaelbling"],"abstract":"Many robotic planning applications involve continuous actions with highly\nnon-linear constraints, which cannot be modeled using modern planners that\nconstruct a propositional representation. We introduce STRIPStream: an\nextension of the STRIPS language which can model these domains by supporting\nthe specification of blackbox generators to handle complex constraints. The\noutputs of these generators interact with actions through possibly infinite\nstreams of objects and static predicates. We provide two algorithms which both\nreduce STRIPStream problems to a sequence of finite-domain planning problems.\nThe representation and algorithms are entirely domain independent. We\ndemonstrate our framework on simple illustrative domains, and then on a\nhigh-dimensional, continuous robotic task and motion planning domain.","url_abs":"http://arxiv.org/abs/1701.00287v2","url_pdf":"http://arxiv.org/pdf/1701.00287v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"strips-planning-in-infinite-domains","repo_url":"https://github.com/caelan/stripstream","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"strips-planning-in-infinite-domains","repo_url":"https://github.com/caelan/pddlstream","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"strips-planning-in-infinite-domains","repo_url":"https://github.com/jingxixu/pddlstream","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"strips-planning-in-infinite-domains","repo_url":"https://github.com/nishadg246/stripstream-ivan-nishad","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"motion-planning","task_name":"Motion Planning"},{"task_slug":"task-and-motion-planning","task_name":"Task and Motion Planning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1701.00287","atlas_url":"https://app.syntology.ai/?focus=1701.00287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.00287"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jingxixu/pddlstream","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/caelan/pddlstream","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/caelan/stripstream","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nishadg246/stripstream-ivan-nishad","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_fixture":1,"unverified":4},"by_repo_kind":{"official":{"samples":4,"ran":0,"repositories":1},"listed":{"samples":1,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"samples":[{"code_sha256_prefix":"f9962248d6dc12ab","entry":"get_predicates","repo":"caelan/pddlstream","repo_kind":"listed","path":"pddlstream/algorithms/advanced.py","file_url":"https://github.com/caelan/pddlstream/blob/HEAD/pddlstream/algorithms/advanced.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"f9962248d6dc12ab"}},{"code_sha256_prefix":"891df9c3a435284a","entry":"header","repo":"caelan/stripstream","repo_kind":"official","path":"stripstream/utils.py","file_url":"https://github.com/caelan/stripstream/blob/HEAD/stripstream/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"891df9c3a435284a"}},{"code_sha256_prefix":"6dd6a673e87e8988","entry":"implies","repo":"caelan/stripstream","repo_kind":"official","path":"stripstream/utils.py","file_url":"https://github.com/caelan/stripstream/blob/HEAD/stripstream/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6dd6a673e87e8988"}},{"code_sha256_prefix":"726e392064910bab","entry":"retrace","repo":"caelan/stripstream","repo_kind":"official","path":"stripstream/algorithms/search/bfs.py","file_url":"https://github.com/caelan/stripstream/blob/HEAD/stripstream/algorithms/search/bfs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"726e392064910bab"}},{"code_sha256_prefix":"915fe54f143e39cc","entry":"separator","repo":"caelan/stripstream","repo_kind":"official","path":"stripstream/utils.py","file_url":"https://github.com/caelan/stripstream/blob/HEAD/stripstream/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"915fe54f143e39cc"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}