Papers › PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic...

PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning

23 Feb 2018arXiv:1802.08705archive 2025-07-28

Caelan Reed Garrett, Tomás Lozano-Pérez, Leslie Pack Kaelbling

Many planning applications involve complex relationships defined on high-dimensional, continuous variables. For example, robotic manipulation requires planning with kinematic, collision, visibility, and motion constraints involving robot configurations, object poses, and robot trajectories. These constraints typically require specialized procedures to sample satisfying values. We extend PDDL to support a generic, declarative specification for these procedures that treats their implementation as black boxes. We provide domain-independent algorithms that reduce PDDLStream problems to a sequence of finite PDDL problems. We also introduce an algorithm that dynamically balances exploring new candidate plans and exploiting existing ones. This enables the algorithm to greedily search the space of parameter bindings to more quickly solve tightly-constrained problems as well as locally optimize to produce low-cost solutions. We evaluate our algorithms on three simulated robotic planning domains as well as several real-world robotic tasks.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1802.08705")

Code

Syntology Ran 1 of 11 code samples harvested from 1 repository linked to this paper; 10 have no recorded run. Of those that ran: 1 ran · fixture could not drive it.

By repository: community (archive-listed): 10 samples from 1 repository, 0 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

caelan/pddlstream officialmentioned in papermentioned on GitHub report
caelan/SS-Replan mentioned on GitHub report
jingxixu/pddlstream mentioned on GitHubMIT report
yijiangh/coop_assembly mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 1 ran; 0 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · fixture could not drive it
10unverified

Licence: 1 of the 11 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from jingxixu/pddlstream. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_partial_orders jingxixu/pddlstream/pddlstream/algorithms/reorder.py community (archive-listed) unverified MIT (permissive) · d386e900a8e909c7 · report
get_stream_plan_index jingxixu/pddlstream/pddlstream/algorithms/skeleton.py community (archive-listed) unverified MIT (permissive) · f937fe9c781274f6 · report
get_stream_stats jingxixu/pddlstream/pddlstream/algorithms/reorder.py community (archive-listed) unverified MIT (permissive) · ffccf7fdccad26de · report
has_costs jingxixu/pddlstream/pddlstream/algorithms/algorithm.py community (archive-listed) unverified MIT (permissive) · ada270c18a73f7a5 · report
instantiate_axioms jingxixu/pddlstream/pddlstream/algorithms/scheduling/relaxed.py community (archive-listed) unverified MIT (permissive) · 62949c5f9f999a37 · report
int_ceil jingxixu/pddlstream/pddlstream/utils.py community (archive-listed) unverified MIT (permissive) · 6de4f21b08e390ac · report
is_double_bound jingxixu/pddlstream/pddlstream/algorithms/skeleton.py community (archive-listed) unverified MIT (permissive) · 21ff56b68452baf9 · report
plan_preimage jingxixu/pddlstream/pddlstream/algorithms/scheduling/relaxed.py community (archive-listed) unverified MIT (permissive) · 5562c34a4ff171c5 · report
read jingxixu/pddlstream/pddlstream/utils.py community (archive-listed) unverified MIT (permissive) · 37d549f907d5280f · report
read_pickle jingxixu/pddlstream/pddlstream/utils.py community (archive-listed) unverified MIT (permissive) · 257cc63283c5f9a0 · report
get_predicates identical code first harvested elsewhere ran · fixture could not drive it licence of this copy not recorded · f9962248d6dc12ab · report

Tasks

Motion Planning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections