pith. sign in

arxiv: 1907.00506 · v1 · pith:RSU2BDSQnew · submitted 2019-07-01 · 💻 cs.RO

Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search

Mengyu Fu , Alan Kuntz , Oren Salzman , Ron Alterovitz This is my paper

Pith reviewed 2026-05-25 12:27 UTC · model grok-4.3

classification 💻 cs.RO
keywords inspection planningmotion planningsampling-based planningasymptotically optimalgraph searchroboticsmedical robotics
0
0 comments X

The pith

IRIS computes inspection plans whose length and set of inspected points asymptotically converge to optimal by incrementally densifying roadmaps and searching them efficiently.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces IRIS, a method for robot inspection planning where the goal is to find motions that let the robot view a given set of points. The search space grows exponentially as more points are added, making direct optimal search impractical. IRIS grows a sampling-based roadmap in stages and runs an efficient near-optimal graph search after each addition. This produces plans that get steadily closer to the shortest length and the full set of points that an optimal plan would achieve. A reader would care because the approach delivers higher-quality plans much faster than earlier methods on both simulated arms and real medical robot tasks.

Core claim

We propose a novel method, Incremental Random Inspection-roadmap Search (IRIS), that computes inspection plans whose length and set of inspected points asymptotically converge to those of an optimal inspection plan. IRIS incrementally densifies a motion planning roadmap using sampling-based algorithms, and performs efficient near-optimal graph search over the resulting roadmap as it is generated.

What carries the argument

Incremental Random Inspection-roadmap Search (IRIS): repeated incremental densification of a sampling-based roadmap paired with efficient near-optimal graph search performed after each densification step.

If this is right

  • IRIS produces higher-quality inspection paths orders of magnitude faster than a prior state-of-the-art method.
  • The same incremental roadmap-plus-search loop works for both a planar 5DOF manipulator and a continuum parallel surgical robot inspecting anatomy from CT data.
  • Both path length and the exact set of inspected points improve toward the optimal values as the roadmap is densified.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The incremental-densification-plus-repeated-search pattern may transfer to other robotic problems whose discrete goal sets create exponential search spaces.
  • Because each search is performed on the current roadmap, the method naturally supports anytime behavior where a coarse plan is available early and improves with extra time.
  • If the near-optimal graph search subroutine itself has tunable approximation parameters, further trade-offs between speed and closeness to optimality could be explored.

Load-bearing premise

That repeated incremental addition of samples to the roadmap, followed by re-searching, will drive solution quality toward the global optimum without the search cost growing faster than the quality gains.

What would settle it

An experiment in which plan length and inspected-point count stop improving once the roadmap reaches a moderate density, or in which search time per iteration grows faster than the observed quality improvement, would show the asymptotic convergence does not occur.

Figures

Figures reproduced from arXiv: 1907.00506 by Alan Kuntz, Mengyu Fu, Oren Salzman, Ron Alterovitz.

Figure 1
Figure 1. Figure 1: Inspection planning in human anatomy. Top Left: The [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Overview of the IRIS algorithmic framework and return the best inspection plan found up until that point. We achieve this by incrementally densifying the roadmap and then searching over the densified roadmap for a near-optimal inspection plan—a process that is repeated as time allows. By reducing the approximation factor between iterations, we ensure that our method is asymptotically optimal. The key contr… view at source ↗
Figure 3
Figure 3. Figure 3: Computing optimal inspection paths on graphs by casting a [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Visualization of the notion of dominating paths by considering a path [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Depiction of operations on path pairs. (a) [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Visualization of Alg. 1 initialized with [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Simulation scenarios. (a) A 5-link planar manipulator (orange) [PITH_FULL_IMAGE:figures/full_fig_p008_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Quality of inspection paths computed for the planar manipulator. (a) [PITH_FULL_IMAGE:figures/full_fig_p009_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Comparing quality of inspection paths computed for the [PITH_FULL_IMAGE:figures/full_fig_p009_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Time decomposition of IRIS as a function of iteration number. lazy look-ahead—In the initial stages of the algorithm, when search is not a bottleneck, employ a large look-ahead (which corresponds to a performing more search). As the algorithm progress, reduce the look-ahead to account for the fact that edge-evaluation is relatively cheaper than graph search. C. Efficient sampling of configurations in RRT … view at source ↗
read the original abstract

Inspection planning, the task of planning motions that allow a robot to inspect a set of points of interest, has applications in domains such as industrial, field, and medical robotics. Inspection planning can be computationally challenging, as the search space over motion plans that inspect the points of interest grows exponentially with the number of inspected points. We propose a novel method, Incremental Random Inspection-roadmap Search (IRIS), that computes inspection plans whose length and set of inspected points asymptotically converge to those of an optimal inspection plan. IRIS incrementally densifies a motion planning roadmap using sampling-based algorithms, and performs efficient near-optimal graph search over the resulting roadmap as it is generated. We demonstrate IRIS's efficacy on a simulated planar 5DOF manipulator inspection task and on a medical endoscopic inspection task for a continuum parallel surgical robot in anatomy segmented from patient CT data. We show that IRIS computes higher-quality inspection paths orders of magnitudes faster than a prior state-of-the-art method.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes the IRIS algorithm for inspection planning, which incrementally densifies a sampling-based motion planning roadmap and applies efficient near-optimal graph search to produce inspection plans. It claims that both the length of the returned paths and the set of inspected points asymptotically converge to those of an optimal inspection plan as the roadmap is refined. The method is evaluated on a simulated 5DOF planar manipulator task and a medical endoscopic inspection task using patient CT data, where it is reported to achieve orders-of-magnitude speedups relative to a prior state-of-the-art baseline.

Significance. If the asymptotic convergence claim is rigorously established, the work would offer a practical bridge between sampling-based planning and graph-search techniques for inspection problems whose combinatorial complexity grows with the number of points of interest. The reported empirical speedups on both simulated and anatomically realistic instances would indicate improved scalability for applications in industrial and medical robotics.

major comments (2)
  1. [Abstract, §3] Abstract and §3 (algorithm description): the central claim requires that path lengths converge to the globally optimal inspection plan length as roadmap density → ∞. The method relies on 'efficient near-optimal graph search' whose approximation ratio or additive error is not shown to vanish with increasing roadmap size; a fixed-factor or fixed-error approximation would leave a persistent gap that prevents asymptotic convergence of lengths even if the underlying shortest-path distances in the roadmap converge.
  2. [§4] §4 (theoretical analysis): no derivation or proof sketch is supplied showing that the combination of incremental densification and near-optimal search yields convergence of both inspected-set cardinality and path length; the abstract asserts the property but the load-bearing argument for why the near-optimality does not block the limit is missing.
minor comments (2)
  1. [§5] Figure captions and experimental section should explicitly state the number of independent runs, variance, and exact baseline implementation details to allow reproduction of the reported speedups.
  2. [§2, §3] Notation for the inspection-roadmap graph and the near-optimal search subroutine should be introduced with a single consistent symbol table rather than scattered definitions.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive feedback. The comments highlight important gaps in the presentation of the asymptotic convergence claim, which we will address through revisions.

read point-by-point responses

  1. Referee: [Abstract, §3] Abstract and §3 (algorithm description): the central claim requires that path lengths converge to the globally optimal inspection plan length as roadmap density → ∞. The method relies on 'efficient near-optimal graph search' whose approximation ratio or additive error is not shown to vanish with increasing roadmap size; a fixed-factor or fixed-error approximation would leave a persistent gap that prevents asymptotic convergence of lengths even if the underlying shortest-path distances in the roadmap converge.

    Authors: We agree that the manuscript does not explicitly rule out a persistent approximation gap. In IRIS the graph search computes exact shortest paths on the current finite roadmap (the 'near-optimal' qualifier refers to the use of efficient incremental/A* implementations rather than bounded-suboptimal search with fixed error). Because sampling-based roadmaps are known to converge in the limit, the exact discrete shortest-path distances converge to the continuous optimum; hence the inspection-plan lengths also converge. We will revise the abstract and §3 to clarify that the search is exact on each finite graph and will add a short supporting paragraph in §4. revision: yes

  2. Referee: [§4] §4 (theoretical analysis): no derivation or proof sketch is supplied showing that the combination of incremental densification and near-optimal search yields convergence of both inspected-set cardinality and path length; the abstract asserts the property but the load-bearing argument for why the near-optimality does not block the limit is missing.

    Authors: The referee correctly notes the absence of an explicit derivation. The original §4 relies on standard results for roadmap convergence plus exact graph search but does not spell out the combination. We will insert a concise proof sketch in the revised §4 that (i) recalls the asymptotic optimality of the underlying sampling-based roadmap, (ii) notes that the search returns the exact shortest path on the current graph, and (iii) concludes that both path length and the cardinality of the inspected set therefore converge to their optimal values. revision: yes

Circularity Check

0 steps flagged

No circularity; algorithmic construction is self-contained

full rationale

The paper presents IRIS as a novel combination of incremental sampling-based roadmap densification and near-optimal graph search over the growing graph. The asymptotic convergence claim is asserted from the known limiting behavior of sampling-based motion planners (as roadmap density increases) together with the search procedure; neither step reduces by definition or by self-citation to the target result itself. The method is explicitly compared against an external prior state-of-the-art baseline rather than to any quantity fitted inside the paper. No self-definitional, fitted-input, or load-bearing self-citation patterns appear in the derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on standard properties of sampling-based motion planners being able to asymptotically cover configuration space and on the existence of efficient near-optimal graph search routines; no free parameters or new physical entities are introduced in the abstract.

axioms (1)
  • domain assumption Sampling-based algorithms can incrementally densify a roadmap so that paths found on the roadmap converge to optimal paths in the underlying continuous space.
    This is the foundational assumption that allows the incremental construction to be claimed to approach optimality.
invented entities (1)
  • IRIS algorithm no independent evidence
    purpose: Compute asymptotically optimal inspection plans via incremental roadmap search.
    The algorithm itself is the novel contribution introduced by the paper.

pith-pipeline@v0.9.0 · 5702 in / 1319 out tokens · 63893 ms · 2026-05-25T12:27:15.741507+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

59 extracted references · 59 canonical work pages

  1. [1]

    Multi- heuristic A*

    Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, and Maxim Likhachev. Multi- heuristic A*. The International Journal of Robotics Research, 35(1-3):224–243, 2016

    work page 2016

  2. [2]

    A survey on inspect- ing structures using robotic systems

    Randa Almadhoun, Tarek Taha, Lakmal Seneviratne, Jorge Dias, and Guowei Cai. A survey on inspect- ing structures using robotic systems. Int. J. Advanced Robotic Systems, 13(6), 2016

    work page 2016

  3. [3]

    Anderson, Arthur W

    Patrick L. Anderson, Arthur W. Mahoney, and Robert J. Webster III. Continuum Reconfigurable Parallel Robots for Surgery: Shape Sensing and State Estimation With Uncertainty. IEEE Robotics and Automation Letters , 2 (3):1617–1624, 2017

    work page 2017

  4. [4]

    Robotic Tools for Deep Water Archaeology: Surveying an Ancient Shipwreck with an Autonomous Underwater Vehicle

    Brian Bingham, Brendan Foley, Hanumant Singh, Richard Camilli, Katerina Delaporta, Ryan Eustice, An- gelos Mallios, David Mindell, Christopher Roman, and Dimitris Sakellariou. Robotic Tools for Deep Water Archaeology: Surveying an Ancient Shipwreck with an Autonomous Underwater Vehicle. J. of Field Robotics , 27(6):702–717, 2010

    work page 2010

  5. [5]

    Structural Inspection Path Planning via Iterative Viewpoint Resampling with Application to Aerial Robotics

    Andreas Bircher, Kostas Alexis, Michael Burri, Philipp Oettershagen, Sammy Omari, Thomas Mantel, and Roland Siegwart. Structural Inspection Path Planning via Iterative Viewpoint Resampling with Application to Aerial Robotics. In IEEE Int. Conf. Robotics and Automation (ICRA), pages 6423–6430. IEEE, 2015

    work page 2015

  6. [6]

    Three-dimensional cov- erage path planning via viewpoint resampling and tour optimization for aerial robots

    Andreas Bircher, Mina Kamel, Kostas Alexis, Michael Burri, Philipp Oettershagen, Sammy Omari, Thomas Mantel, and Roland Siegwart. Three-dimensional cov- erage path planning via viewpoint resampling and tour optimization for aerial robots. Autonomous Robots , 40 (6):1059–1078, 2016

    work page 2016

  7. [7]

    An Incremental Samplingbased Approach to Inspection Planning: The Rapidlyexploring Random Tree Of Trees

    Andreas Bircher, Kostas Alexis, Ulrich Schwesinger, Sammy Omari, Michael Burri, and Roland Siegwart. An Incremental Samplingbased Approach to Inspection Planning: The Rapidlyexploring Random Tree Of Trees. Robotica, 35(6):1327–1340, 2017

    work page 2017

  8. [8]

    A Gradient-Based Inspection Path Optimization Approach

    Boris Bogaerts, Seppe Sels, Steve Vanlanduit, and Rudi Penne. A Gradient-Based Inspection Path Optimization Approach. IEEE Robotics and Automation Letters , 3(3): 2646–2653, 2018

    work page 2018

  9. [9]

    Robert Bohlin and Lydia E. Kavraki. Path Planning Using Lazy PRM. In IEEE Int. Conf. Robotics and Automation (ICRA), pages 521–528, 2000

    work page 2000

  10. [10]

    Bicriterion shortest path problem with a general nonadditive cost

    Peng Chen and Yu Nie. Bicriterion shortest path problem with a general nonadditive cost. Transportation Research Part B: Methodological, 57:419–435, 2013

    work page 2013

  11. [11]

    Choset, Seth Hutchinson, Kevin M

    Howie M. Choset, Seth Hutchinson, Kevin M. Lynch, George Kantor, Wolfram Burgard, Lydia E. Kavraki, and Sebastian Thrun. Principles of Robot Motion: Theory, Algorithms, and Implementation . MIT press, 2005

    work page 2005

  12. [12]

    Tim Danner and Lydia E. Kavraki. Randomized Planning for Short Inspection Paths. In IEEE Int. Conf. Robotics and Automation (ICRA) , pages 971–976, 2000

    work page 2000

  13. [13]

    Dellin and Siddhartha S

    Christopher M. Dellin and Siddhartha S. Srinivasa. A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors. In Int. Conf. Automated Planning and Scheduling (ICAPS), pages 459–467, 2016

    work page 2016

  14. [14]

    Dijkstra

    Edsger W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1(1): 269–271, 1959

    work page 1959

  15. [15]

    Multiregion Inspection by Combining Clustered Travel- ing Salesman Tours With Sampling-Based Motion Plan- ning

    Stefan Edelkamp, Mihai Pomarlan, and Erion Plaku. Multiregion Inspection by Combining Clustered Travel- ing Salesman Tours With Sampling-Based Motion Plan- ning. IEEE Robotics and Automation Letters , 2(2):428– 435, 2017

    work page 2017

  16. [16]

    A survey and annotated bibliography of multiobjective combinatorial optimization

    Matthias Ehrgott and Xavier Gandibleux. A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum, 22(4):425–460, 2000

    work page 2000

  17. [17]

    Brendan Englot and Franz S. Hover. Sampling-Based Coverage Path Planning for Inspection of Complex Struc- tures. In Int. Conf. Automated Planning and Scheduling (ICAPS), pages 29–37, 2012

    work page 2012

  18. [18]

    Englot and Franz S

    Brendan J. Englot and Franz S. Hover. Planning Complex Inspection Tasks Using Redundant Roadmaps. In Int. Symp. Robotics Research (ISRR) , pages 327–343, 2011

    work page 2011

  19. [19]

    Fully Dynamic Algorithms for Main- taining Shortest Paths Trees

    Daniele Frigioni, Alberto Marchetti-Spaccamela, and Umberto Nanni. Fully Dynamic Algorithms for Main- taining Shortest Paths Trees. J. Algorithms, 34(2):251– 281, 2000

    work page 2000

  20. [20]

    A survey on coverage path planning for robotics

    Enric Galceran and Marc Carreras. A survey on coverage path planning for robotics. Robotics and Autonomous Systems, 61(12):1258–1276, 2013

    work page 2013

  21. [21]

    Mapping the Moon: Using a lightweight AUV to survey the site of the 17th Century ship La Lune

    Nuno Gracias, Pere Ridao, Rafael Garcia, Javier Escart´ın, Michel L’Hour, Franca Cibecchini, Ricard Campos, Marc Carreras, David Ribas, Narc´ıs Palomeras, et al. Mapping the Moon: Using a lightweight AUV to survey the site of the 17th Century ship La Lune. In OCEANS-Bergen, 2013 MTS/IEEE, pages 1–8. IEEE, 2013

    work page 2013

  22. [22]

    Procaccia, Oren Salzman, and Siddhartha S

    Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, and Siddhartha S. Srinivasa. The Provable Virtue of Laziness in Motion Planning. In Int. Conf. Automated Planning and Scheduling (ICAPS) , pages 106–113, 2018

    work page 2018

  23. [23]

    Algo- rithmic motion planning

    Dan Halperin, Oren Salzman, and Micha Sharir. Algo- rithmic motion planning. In Handbook of Discrete and Computational Geometry, Third Edition. , pages 1311–

    work page

  24. [24]

    Hart, Nils J

    Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Mini- mum Cost Paths. IEEE Transactions on Systems, Science, and Cybernetics, 4(2):100–107, 1968

    work page 1968

  25. [25]

    Lazy collision checking in asymptotically- optimal motion planning

    Kris Hauser. Lazy collision checking in asymptotically- optimal motion planning. In IEEE Int. Conf. Robotics and Automation (ICRA) , pages 2951–2957, 2015

    work page 2015

  26. [26]

    Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs

    Brian Ichter, Edward Schmerling, and Marco Pavone. Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs. In IEEE Int. Conf. Robotic Computing (IRC) , pages 219–226, 2017

    work page 2017

  27. [27]

    Online, interactive user guidance for high-dimensional, constrained motion planning

    Fahad Islam, Oren Salzman, and Maxim Likhachev. Online, interactive user guidance for high-dimensional, constrained motion planning. In Int. Joint Conf. on Artificial Intelligence (IJCAI) , pages 4921–4928, 2018

    work page 2018

  28. [28]

    Williams, and Ian Mahon

    Matthew Johnson-Roberson, Oscar Pizarro, Stefan B. Williams, and Ian Mahon. Generation and Visualization of Large-Scale Three-Dimensional Reconstructions from Underwater Robotic Surveys. J. of Field Robotics, 27(1): 21–51, 2010

    work page 2010

  29. [29]

    Random Inspection Tree Algorithm in Visual Inspection with a Realistic Sensing Model and Differential Constraints

    P ˇremysl Kafka, Jan Faigl, and Petr V ´aˇna. Random Inspection Tree Algorithm in Visual Inspection with a Realistic Sensing Model and Differential Constraints. In IEEE Int. Conf. Robotics and Automation (ICRA) , pages 2782–2787, 2016

    work page 2016

  30. [30]

    Sampling-Based Algorithms for Optimal Motion Planning

    Sertac Karaman and Emilio Frazzoli. Sampling-Based Algorithms for Optimal Motion Planning. Int. J. Robotics Research (IJRR), 30(7):846–894, 2011

    work page 2011

  31. [31]

    Kavraki, Petr Svestka, Jean-Claude Latombe, and Mark H

    Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, and Mark H. Overmars. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans. Robotics and Automation, 12(4):566–580, August 1996

    work page 1996

  32. [32]

    Life- long Planning A*

    Sven Koenig, Maxim Likhachev, and David Furcy. Life- long Planning A*. Artificial Intelligence , 155(1-2):93– 146, 2004

    work page 2004

  33. [33]

    Kuffner and Steven M

    James J. Kuffner and Steven M. LaValle. RRT-Connect: An Efficient Approach to Single-Query Path Planning. In IEEE Int. Conf. Robotics and Automation (ICRA) , volume 2, pages 995–1001, 2000

    work page 2000

  34. [34]

    Ma- honey, Patrick L

    Alan Kuntz, Chris Bowen, Cenk Baykal, Arthur W. Ma- honey, Patrick L. Anderson, Fabien Maldonado, Robert J. Webster III, and Ron Alterovitz. Kinematic Design Optimization of a Parallel Surgical Robot to Maximize Anatomical Visibility via Motion Planning. In IEEE Int. Conf. Robotics and Automation (ICRA) , pages 926–933, 2018

    work page 2018

  35. [35]

    Robot Motion Planning

    Jean-Claude Latombe. Robot Motion Planning . Kluwer, Boston, MA, 1991

    work page 1991

  36. [36]

    Steven M. LaValle. Planning Algorithms . Cambridge University Press, Cambridge, U.K., 2006

    work page 2006

  37. [37]

    LaValle and James J

    Steven M. LaValle and James J. Kuffner. Randomized Kinodynamic Planning. Int. J. Robotics Research (IJRR), 20(5):378–400, May 2001

    work page 2001

  38. [38]

    Yanbo Li, Zakary Littlefield, and Kostas E. Bekris. Asymptotically optimal sampling-based kinodynamic planning. Int. J. Robotics Research (IJRR) , 35(5):528– 564, 2016

    work page 2016

  39. [39]

    Lynch and Frank C

    Kevin M. Lynch and Frank C. Park. Modern Robotics: Mechanics, Planning, and Control . Cambridge Univer- sity Press, 2017

    work page 2017

  40. [40]

    Mahoney, Patrick L

    Arthur W. Mahoney, Patrick L. Anderson, Philip J. Swaney, Fabien Maldonado, and Robert J. Webster III. Reconfigurable Parallel Continuum Robots for Incision- less Surgery. In IEEE/RSJ Int. Conf. Intelligent Robots and Systems (IROS) , pages 4330–4336, 2016

    work page 2016

  41. [41]

    Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges

    Aditya Mandalika, Oren Salzman, and Siddhartha Srini- vasa. Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges. In Int. Conf. Automated Planning and Scheduling (ICAPS) , pages 476–484, 2018

    work page 2018

  42. [42]

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

    Aditya Mandalika, Sanjiban Choudhury, Oren Salzman, and Siddhartha Srinivasa. Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles. In Int. Conf. Automated Planning and Scheduling (ICAPS) , 2019

    work page 2019

  43. [43]

    Marble and Kostas E

    James D. Marble and Kostas E. Bekris. Asymptotically near-optimal is good enough for motion planning. In Int. Symp. Robotics Research (ISRR) , pages 419–436, 2011

    work page 2011

  44. [44]

    Following Surgical Trajectories with Concentric Tube Robots via Nearest- Neighbor Graphs

    Sherdil Niyaz, Alan Kuntz, Oren Salzman, Ron Al- terovitz, and Siddhartha Srinivasa. Following Surgical Trajectories with Concentric Tube Robots via Nearest- Neighbor Graphs. In Int. Symp. Experimental Robotics (ISER), 2018

    work page 2018

  45. [45]

    Asymptotically Optimal Inspection Planning using Systems with Differential Constraints

    Georgios Papadopoulos, Hanna Kurniawati, and Nicholas M Patrikalakis. Asymptotically Optimal Inspection Planning using Systems with Differential Constraints. In IEEE Int. Conf. Robotics and Automation (ICRA), pages 4126–4133. IEEE, 2013

    work page 2013

  46. [46]

    Pardalos, Athanasios Migdalas, and Leonidas Pitsoulis

    Panos M. Pardalos, Athanasios Migdalas, and Leonidas Pitsoulis. Pareto optimality, game theory and equilibria , volume 17. Springer Science & Business Media, 2008

    work page 2008

  47. [47]

    Off-line view planning for the inspection of mechanical parts

    Roberto Raffaeli, Maura Mengoni, Michele Germani, and Ferruccio Mandorli. Off-line view planning for the inspection of mechanical parts. International Journal on Interactive Design and Manufacturing (IJIDeM) , 7(1): 1–12, 2013

    work page 2013

  48. [48]

    On the Compu- tational Complexity of Dynamic Graph Problems

    Ganesan Ramalingam and Thomas Reps. On the Compu- tational Complexity of Dynamic Graph Problems. Theor. Comput. Sci., 158(1&2):233–277, 1996

    work page 1996

  49. [49]

    Effective footstep planning for humanoids using homotopy-class guidance

    Vinitha Ranganeni, Oren Salzman, and Maxim Likhachev. Effective footstep planning for humanoids using homotopy-class guidance. In Int. Conf. Automated Planning and Scheduling (ICAPS), pages 500–508, 2018

    work page 2018

  50. [50]

    Multi- objective and multi-constrained non-additive shortest path problems

    Line Blander Reinhardt and David Pisinger. Multi- objective and multi-constrained non-additive shortest path problems. Computers & OR , 38(3):605–616, 2011

    work page 2011

  51. [51]

    Asymptotically- optimal Motion Planning using lower bounds on cost

    Oren Salzman and Dan Halperin. Asymptotically- optimal Motion Planning using lower bounds on cost. In IEEE Int. Conf. Robotics and Automation (ICRA) , pages 4167–4172, 2015

    work page 2015

  52. [52]

    Asymptotically Near- Optimal RRT for Fast, High-Quality Motion Planning

    Oren Salzman and Dan Halperin. Asymptotically Near- Optimal RRT for Fast, High-Quality Motion Planning. IEEE Trans. Robotics , 32(3):473–483, 2016

    work page 2016

  53. [53]

    Efficient Motion Planning for Problems Lacking Optimal Substructure

    Oren Salzman, Brian Hou, and Siddhartha Srinivasa. Efficient Motion Planning for Problems Lacking Optimal Substructure. In Int. Conf. Automated Planning and Scheduling (ICAPS), pages 531–539, 2017

    work page 2017

  54. [54]

    Optimal sampling-based motion planning under differ- ential constraints: The driftless case

    Edward Schmerling, Lucas Janson, and Marco Pavone. Optimal sampling-based motion planning under differ- ential constraints: The driftless case. In IEEE Int. Conf. Robotics and Automation (ICRA) , pages 2368– 2375, 2015

    work page 2015

  55. [55]

    New perspective on sampling-based motion planning via ran- dom geometric graphs

    Kiril Solovey, Oren Salzman, and Dan Halperin. New perspective on sampling-based motion planning via ran- dom geometric graphs. Int. J. Robotics Research (IJRR) , 37(10):1117 – 1133, 2018

    work page 2018

  56. [56]

    Starek, Javier V

    Joseph A. Starek, Javier V . G ´omez, Edward Schmerling, Lucas Janson, Luis Moreno, and Marco Pavone. An asymptotically-optimal sampling-based algorithm for Bi- directional motion planning. In IEEE/RSJ Int. Conf. Intelligent Robots and Systems (IROS), pages 2072–2078, 2015

    work page 2072

  57. [57]

    Tivey, Albert Bradley, Dana Yoerger, Rodney Catanach, Alan Duester, Steve Liberatore, and Hanu Singh

    Maurice A. Tivey, Albert Bradley, Dana Yoerger, Rodney Catanach, Alan Duester, Steve Liberatore, and Hanu Singh. Autonomous Underwater Vehicle Maps Seafloor. Eos, Transactions American Geophysical Union , 78(22): 229–230, 1997

    work page 1997

  58. [58]

    Zaroliagis

    George Tsaggouris and Christos D. Zaroliagis. Non- additive Shortest Paths. In European Symposium on Algorithms (ESA), pages 822–834, 2004

    work page 2004

  59. [59]

    Zaroliagis

    George Tsaggouris and Christos D. Zaroliagis. Multiob- jective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications. Theory of Computing Systems, 45(1):162–186, 2009

    work page 2009