ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1904.02795
  4. Cited By
Generalized Lazy Search for Robot Motion Planning: Interleaving Search
  and Edge Evaluation via Event-based Toggles

Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles

4 April 2019
Aditya Mandalika
Sanjiban Choudhury
Oren Salzman
S. Srinivasa
ArXivPDFHTML

Papers citing "Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles"

12 / 12 papers shown
Title
Robotic Exploration using Generalized Behavioral Entropy
Robotic Exploration using Generalized Behavioral Entropy
A. Suresh
Carlos Nieto-Granda
Sonia Martínez
49
3
0
15 Feb 2024
Predicate Invention for Bilevel Planning
Predicate Invention for Bilevel Planning
Tom Silver
Rohan Chitnis
Nishanth Kumar
Willie McClinton
Tomás Lozano-Pérez
L. Kaelbling
J. Tenenbaum
167
42
0
17 Mar 2022
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with
  Expensive-to-Evaluate Edges
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Aditya Mandalika
Oren Salzman
S. Srinivasa
39
50
0
13 Mar 2018
Bayesian Active Edge Evaluation on Expensive Graphs
Bayesian Active Edge Evaluation on Expensive Graphs
Sanjiban Choudhury
S. Srinivasa
Sebastian Scherer
37
11
0
20 Nov 2017
Data-driven Planning via Imitation Learning
Data-driven Planning via Imitation Learning
Sanjiban Choudhury
M. Bhardwaj
S. Arora
Ashish Kapoor
G. Ranade
Sebastian Scherer
Debadeepta Dey
82
81
0
17 Nov 2017
The Provable Virtue of Laziness in Motion Planning
The Provable Virtue of Laziness in Motion Planning
Nika Haghtalab
Simon Mackenzie
Ariel D. Procaccia
Oren Salzman
S. Srinivasa
48
45
0
11 Oct 2017
Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs
Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs
Sanjiban Choudhury
Shervin Javdani
S. Srinivasa
Sebastian Scherer
59
16
0
28 Jun 2017
A Unifying Formalism for Shortest Path Problems with Expensive Edge
  Evaluations via Lazy Best-First Search over Paths with Edge Selectors
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
Christopher M. Dellin
S. Srinivasa
33
71
0
10 Mar 2016
Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the
  Heuristically Guided Search of Implicit Random Geometric Graphs
Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs
Jonathan Gammell
S. Srinivasa
Timothy D. Barfoot
74
449
0
22 May 2014
Asymptotically near-optimal RRT for fast, high-quality, motion planning
Asymptotically near-optimal RRT for fast, high-quality, motion planning
Oren Salzman
Dan Halperin
64
180
0
01 Aug 2013
Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal
  Motion Planning in Many Dimensions
Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
Lucas Janson
Edward Schmerling
Ashley Clark
Marco Pavone
64
528
0
15 Jun 2013
Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
97
4,689
0
05 May 2011
1