On the public citation graph

Leveraging Experience in Lazy Search

0 signed · 44 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpa.3160360305openalex-snapshot
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50040-2openalex-snapshot
Stable Function Approximation in Dynamic Programming
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50052-9openalex-snapshot
Learning policies for partially observable environments: Scaling up
inferredcites →https://doi.org/10.1109/icra.2015.7139603openalex-snapshot
Lazy collision checking in asymptotically-optimal motion planning
inferredcites →https://doi.org/10.1109/icra.2016.7487116openalex-snapshot
Learning high-dimensional Mixture Models for fast collision detection in Rapidly-Exploring Random Trees
inferredcites →https://doi.org/10.1109/icra.2016.7487117openalex-snapshot
Burs of free C-space: A novel structure for path planning
inferredcites →https://doi.org/10.1109/icra.2017.7989043openalex-snapshot
Learning from the hindsight plan — Episodic MPC improvement
inferredcites →https://doi.org/10.1109/icra.2017.7989379openalex-snapshot
PLATO: Policy learning using adaptive trajectory optimization
inferredcites →https://doi.org/10.1109/iros.2013.6696513openalex-snapshot
Free-configuration biased sampling for motion planning
inferredcites →https://doi.org/10.1109/iros.2016.7759551openalex-snapshot
Pareto-optimal search over configuration space beliefs for anytime motion planning
inferredcites →https://doi.org/10.1109/robot.1997.619371openalex-snapshot
Path planning in expansive configuration spaces
inferredcites →https://doi.org/10.1109/robot.2000.844107openalex-snapshot
Path planning using lazy PRM
inferredcites →https://doi.org/10.1109/robot.2005.1570590openalex-snapshot
Sampling-Based Motion Planning Using Predictive Models
inferredcites →https://doi.org/10.1142/s0218195999000285openalex-snapshot
PATH PLANNING IN EXPANSIVE CONFIGURATION SPACES
inferredcites →https://doi.org/10.1145/1265530.1265538openalex-snapshot
Decision trees for entity identification
inferredcites →https://doi.org/10.1177/0278364918781001openalex-snapshot
Data-driven planning via imitation learning
inferredcites →https://doi.org/10.1184/r1/6550949openalex-snapshot
A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning
inferredcites →https://doi.org/10.1184/r1/6556946openalex-snapshot
Near Optimal Bayesian Active Learning for Decision Making
inferredcites →https://doi.org/10.15607/rss.2014.x.033openalex-snapshot
Planning Single-arm Manipulations with n-Arm Robots
inferredcites →https://doi.org/10.15607/rss.2014.x.034openalex-snapshot
Pre- and Post-Contact Policy Decomposition for Planar Contact Manipulation Under Uncertainty
inferredcites →https://doi.org/10.15607/rss.2015.xi.032openalex-snapshot
Shared Autonomy via Hindsight Optimization
inferredcites →https://doi.org/10.1609/icaps.v26i1.13788openalex-snapshot
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
inferredcites →https://doi.org/10.1609/icaps.v27i1.13860openalex-snapshot
Heuristic Search on Graphs with Existence Priors for Expensive-to-Evaluate Edges
inferredcites →https://doi.org/10.1609/icaps.v28i1.13879openalex-snapshot
The Provable Virtue of Laziness in Motion Planning
inferredcites →https://doi.org/10.1609/icaps.v28i1.13931openalex-snapshot
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
inferredcites →https://doi.org/10.1609/socs.v6i1.18340openalex-snapshot
Planning Single-Arm Manipulations with N-Arm Robots
inferredcites →https://doi.org/10.24963/ijcai.2018/679openalex-snapshot
Bayesian Active Edge Evaluation on Expensive Graphs
inferredcites →https://doi.org/10.24963/ijcai.2019/855openalex-snapshot
The Provable Virtue of Laziness in Motion Planning
inferredcites →https://doi.org/10.48550/arxiv.1003.3967openalex-snapshot
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization
inferredcites →https://doi.org/10.48550/arxiv.1010.3091openalex-snapshot
Near-Optimal Bayesian Active Learning with Noisy Observations
inferredcites →https://doi.org/10.48550/arxiv.1406.5979openalex-snapshot
Reinforcement and Imitation Learning via Interactive No-Regret Learning
inferredcites →https://doi.org/10.48550/arxiv.1703.01030openalex-snapshot
Deeply AggreVaTeD: Differentiable Imitation Learning for Sequential Prediction
inferredcites →https://doi.org/10.48550/arxiv.1706.09351openalex-snapshot
Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs
inferredcites →https://doi.org/10.48550/arxiv.1707.03034openalex-snapshot
Learning Heuristic Search via Imitation
inferredcites →https://doi.org/10.48550/arxiv.1805.10413openalex-snapshot
Fast Policy Learning through Imitation and Reinforcement

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10514-021-10018-5openalex-snapshot
Leveraging experience in lazy search
inferred← citeshttps://doi.org/10.1016/j.engappai.2021.104399openalex-snapshot
Learning from experience for rapid generation of local car maneuvers
inferred← citeshttps://doi.org/10.1049/csy2.12020openalex-snapshot
A survey of learning‐based robot motion planning
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197014openalex-snapshot
Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197260openalex-snapshot
Differentiable Gaussian Process Motion Planning
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561104openalex-snapshot
Learning Sampling Distributions Using Local 3D Workspace Decompositions for Motion Planning in High Dimensions
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341245openalex-snapshot
Learning an Optimal Sampling Distribution for Efficient Motion Planning
inferred← citeshttps://doi.org/10.1561/2300000063openalex-snapshot
A Survey on the Integration of Machine Learning with Sampling-based Motion Planning
inferred← citeshttps://doi.org/10.1561/9781638281351openalex-snapshot
A Survey on the Integration of Machine Learning with Sampling-based Motion Planning
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.