On the public citation graph
Convex tours of bounded curvature
0 signed · 104 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08353-7_166openalex-snapshot
The medial axis of a simple polygon
inferredcites →https://doi.org/10.1007/978-1-4613-8997-2_28openalex-snapshot
Motion Planning for an Autonomous Vehicle
inferredcites →https://doi.org/10.1007/978-1-4615-3176-0_8openalex-snapshot
Planning Smooth Paths for Mobile Robots
inferredcites →https://doi.org/10.1007/bf01840370openalex-snapshot
Motion planning with inertial constraints
inferredcites →https://doi.org/10.1007/bf02187749openalex-snapshot
A linear-time algorithm for computing the voronoi diagram of a convex polygon
inferredcites →https://doi.org/10.1109/robot.1988.12106openalex-snapshot
Motion planning for an autonomous vehicle
inferredcites →https://doi.org/10.1109/robot.1989.99959openalex-snapshot
Planning smooth paths for mobile robots
inferredcites →https://doi.org/10.1109/sfcs.1985.36openalex-snapshot
Motion planning in the presence of moving obstacles
inferredcites →https://doi.org/10.1109/sfcs.1988.21947openalex-snapshot
On the complexity of kinodynamic planning
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.2307/2372560openalex-snapshot
On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rob.21490openalex-snapshot
Mapping, Planning, and Sample Detection Strategies for Autonomous Exploration
inferred← citeshttps://doi.org/10.1007/0-387-23667-8_3openalex-snapshot
Scatter Search Methods for the Covering Tour Problem
inferred← citeshttps://doi.org/10.1007/11751540_2openalex-snapshot
Optimal Guard Placement Problem Under L-Visibility
inferred← citeshttps://doi.org/10.1007/3-540-45993-6_14openalex-snapshot
On the Competitive Complexity of Navigation Tasks
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_219openalex-snapshot
Shortest safari routes in simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_741openalex-snapshot
Fault tolerant mobility planning for rapidly deployable wireless networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-2256-2_12openalex-snapshot
Safari and Zookeeper Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_44openalex-snapshot
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_1openalex-snapshot
Some Problems Related to Good Illumination
inferred← citeshttps://doi.org/10.1007/978-3-540-78157-8_15openalex-snapshot
An Approximate Algorithm for Solving the Watchman Route Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-00644-9_1openalex-snapshot
Multi-Robot Uniform Frequency Coverage of Significant Locations in the Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_23openalex-snapshot
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_1openalex-snapshot
Optimal Exploration of Terrains with Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-642-21735-7_11openalex-snapshot
Self-Organizing Map for the Multi-Goal Path Planning with Polygonal Goals
inferred← citeshttps://doi.org/10.1007/978-3-642-32723-0_2openalex-snapshot
A Distributed, Real-Time Approach to Multi Robot Uniform Frequency Coverage
inferred← citeshttps://doi.org/10.1007/978-3-642-34732-0_1openalex-snapshot
On Finding Shortest Isothetic Path inside a Digital Object
inferred← citeshttps://doi.org/10.1007/s10472-014-9421-yopenalex-snapshot
On finding a shortest isothetic path and its monotonicity inside a digital object
inferred← citeshttps://doi.org/10.1007/s10846-010-9449-0openalex-snapshot
A Sensor Placement Algorithm for a Mobile Robot Inspection Planning
inferred← citeshttps://doi.org/10.1007/s10846-015-0190-6openalex-snapshot
Robotic Task Sequencing Problem: A Survey
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00220-sopenalex-snapshot
An optimal algorithm for finding the edge visibility polygon under limited visibility
inferred← citeshttps://doi.org/10.1016/0165-0114(94)00301-mopenalex-snapshot
α-Kernel problem with fuzzy visibility
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90008-6openalex-snapshot
Approximation algorithms for the geometric covering salesman problem
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90027-4openalex-snapshot
Minimal link visibility paths inside a simple polygon
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferred← citeshttps://doi.org/10.1016/j.cviu.2014.07.001openalex-snapshot
On the family of shortest isothetic paths in a digital object—An algorithm with applications
inferred← citeshttps://doi.org/10.1016/j.ic.2010.09.005openalex-snapshot
Optimality and competitiveness of exploring polygons by mobile robots
inferred← citeshttps://doi.org/10.1016/j.ic.2013.02.001openalex-snapshot
Worst-case optimal exploration of terrains with obstacles
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104705openalex-snapshot
Advice complexity of treasure hunt in geometric terrains
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.04.010openalex-snapshot
Shortest paths in simple polygons with polygon-meet constraints
inferred← citeshttps://doi.org/10.1016/j.jcp.2015.07.037openalex-snapshot
Path optimization with limited sensing ability
inferred← citeshttps://doi.org/10.1016/j.measurement.2020.108898openalex-snapshot
Optimization of laser scanner positioning networks for architectural surveys through the design of genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.robot.2012.08.013openalex-snapshot
Visiting convex regions in a polygonal map
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.003openalex-snapshot
Query-point visibility constrained shortest paths in simple polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.037openalex-snapshot
Online exploration outside a convex obstacle
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00062-6openalex-snapshot
Performance bounds for planning in unknown terrain
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00284-9openalex-snapshot
Finding shortest safari routes in simple polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00015-8openalex-snapshot
Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00058-xopenalex-snapshot
Optimally computing a shortest weakly visible line segment inside a simple polygon
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00110-4openalex-snapshot
Competitive on-line coverage of grid environments by a mobile robot
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00012-0openalex-snapshot
Angle-Restricted Tours in the plane
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.015openalex-snapshot
Planning Under Sensing Uncertainty
inferred← citeshttps://doi.org/10.1023/a:1016610507833openalex-snapshot
Spanning-tree based coverage of continuous areas by a mobile robot
inferred← citeshttps://doi.org/10.1080/10556788.2015.1055561openalex-snapshot
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
inferred← citeshttps://doi.org/10.1080/10556788.2021.1977811openalex-snapshot
Off-line exploration of rectangular cellular environments with a rectangular obstacle
inferred← citeshttps://doi.org/10.1097/00008469-200304000-00013openalex-snapshot
Literature that you may have missed: A regular contribution from Lars Ovesen, which we hope will help the busy scientist in keeping up with the literature Say cheese
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1109/aipr.2015.7444524openalex-snapshot
Parallel photon mapping computations to enable fast approximate solutions to the art gallery and watchman route problems
inferred← citeshttps://doi.org/10.1109/ecmr.2019.8870971openalex-snapshot
Robot Path Planning for Multiple Target Regions
inferred← citeshttps://doi.org/10.1109/iccta.2007.113openalex-snapshot
Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems
inferred← citeshttps://doi.org/10.1109/iceice.2011.5777777openalex-snapshot
A method of placing sensor position for inspection with constrained visibility
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5357769openalex-snapshot
Constructing visibility graph and planning optimal path for inspection of 2D workspace
inferred← citeshttps://doi.org/10.1109/inss.2007.4297389openalex-snapshot
On Optimal Route of a Calibrating Mobile Sink in a Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/iros.2013.6697225openalex-snapshot
A hybrid algorithm for coverage path planning with imperfect sensors
inferred← citeshttps://doi.org/10.1109/iros.2014.6942582openalex-snapshot
Correlated Orienteering Problem and its application to informative path planning for persistent monitoring tasks
inferred← citeshttps://doi.org/10.1109/roman.2010.5598684openalex-snapshot
Visibility techniques applied to robotics
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492579openalex-snapshot
Controllability, recognizability, and complexity issues in robot motion planning
inferred← citeshttps://doi.org/10.1109/tase.2019.2916855openalex-snapshot
Curvature-Bounded Lengthening and Shortening for Restricted Vehicle Path Planning
inferred← citeshttps://doi.org/10.1109/tnn.2010.2070518openalex-snapshot
Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range
inferred← citeshttps://doi.org/10.1109/tro.2010.2095570openalex-snapshot
Mapping and Pursuit-Evasion Strategies For a Simple Wall-Following Robot
inferred← citeshttps://doi.org/10.1109/tro.2011.2104510openalex-snapshot
A Minimalist Algorithm for Multirobot Continuous Coverage
inferred← citeshttps://doi.org/10.1109/tro.2015.2409453openalex-snapshot
Persistent Monitoring of Events With Stochastic Arrivals at Multiple Stations
inferred← citeshttps://doi.org/10.1109/tro.2016.2593450openalex-snapshot
Correlated Orienteering Problem and its Application to Persistent Monitoring Tasks
inferred← citeshttps://doi.org/10.1137/070682885openalex-snapshot
A Near-Tight Approximation Algorithm for the Robot Localization Problem
inferred← citeshttps://doi.org/10.1137/1.9781611975499.15openalex-snapshot
Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost
inferred← citeshttps://doi.org/10.1137/22m1523790openalex-snapshot
Shortest Paths in Graphs of Convex Sets
inferred← citeshttps://doi.org/10.1137/s0097539703434267openalex-snapshot
Optimal Covering Tours with Turn Costs
inferred← citeshttps://doi.org/10.1137/s0097539799348670openalex-snapshot
The Polygon Exploration Problem
inferred← citeshttps://doi.org/10.1142/s0218127497000546openalex-snapshot
Adaptive Evolutionary Optimization of Team Work
inferred← citeshttps://doi.org/10.1142/s0218195909003003openalex-snapshot
GUARD PLACEMENT FOR MAXIMIZING L -VISIBILITY EXTERIOR TO A CONVEX POLYGON
inferred← citeshttps://doi.org/10.1145/177424.177984openalex-snapshot
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
inferred← citeshttps://doi.org/10.1145/2486159.2486176openalex-snapshot
Optimal patrolling of fragmented boundaries
inferred← citeshttps://doi.org/10.1177/02783640022066716openalex-snapshot
MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown Domains
inferred← citeshttps://doi.org/10.13053/cys-12-4-1215openalex-snapshot
Visibilidad de Alcance Limitado en Polígonos Escalera
inferred← citeshttps://doi.org/10.14288/1.0051866openalex-snapshot
Optimally sweeping convex polygons with two and three guards
inferred← citeshttps://doi.org/10.20868/upm.thesis.517openalex-snapshot
Métodos heurísticos en problemas geométricos. visibilidad, iluminación y vigilancia
inferred← citeshttps://doi.org/10.22215/etd/2016-11649openalex-snapshot
Coordinated Multi-Agents Patrolling Algorithms
inferred← citeshttps://doi.org/10.3390/drones3030059openalex-snapshot
Review: Using Unmanned Aerial Vehicles (UAVs) as Mobile Sensing Platforms (MSPs) for Disaster Response, Civil Security and Public Safety
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5240openalex-snapshot
Exploring Grid Polygons Online
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5253openalex-snapshot
Exploring Simple Triangular and Hexagonal Grid Polygons Online
inferred← citeshttps://doi.org/10.48550/arxiv.1111.2259openalex-snapshot
A Survey on Open Problems for Mobile Robots
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6041openalex-snapshot
Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations
inferred← citeshttps://doi.org/10.48550/arxiv.1402.1896openalex-snapshot
Correlated Orienteering Problem and it Application to Persistent Monitoring Tasks
inferred← citeshttps://doi.org/10.48550/arxiv.cond-mat/0203412openalex-snapshot
Adaptive Evolutionary Optimization of Team Work
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0309014openalex-snapshot
Optimal Covering Tours with Turn Costs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0606013openalex-snapshot
Good Illumination of Minimum Range
inferred← citeshttps://doi.org/10.5555/365411.365430openalex-snapshot
Optimal covering tours with turn costs
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.