On the public citation graph

Planning a time-minimal motion among moving obstacles

0 signed · 59 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.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01840371openalex-snapshot
On multiple moving objects
inferredcites →https://doi.org/10.1007/bf01840436openalex-snapshot
Visibility of disjoint polygons
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50019-0openalex-snapshot
Computational Geometry and Motion Planning
inferredcites →https://doi.org/10.1109/cvpr.1988.196325openalex-snapshot
Accessibility: a new approach to path planning among moving obstacles
inferredcites →https://doi.org/10.1109/jra.1987.1087133openalex-snapshot
Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case
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.1987.42openalex-snapshot
New lower bound techniques for robot motion planning problems
inferredcites →https://doi.org/10.1109/sfcs.1987.6openalex-snapshot
An output sensitive algorithm for computing visibility graphs
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/73393.73411openalex-snapshot
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
inferredcites →https://doi.org/10.1177/027836498600500304openalex-snapshot
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
inferredcites →https://doi.org/10.1201/9781420035315-47openalex-snapshot
Algorithmic motion planning
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-21090-7_32openalex-snapshot
A Lower Bounding Framework for Motion Planning Amid Dynamic Obstacles in 2D
inferred← citeshttps://doi.org/10.1007/978-3-540-74205-0_58openalex-snapshot
A Genetic Algorithm for Shortest Path Motion Problem in Three Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-642-17452-0_5openalex-snapshot
Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-35197-6_9openalex-snapshot
A Braitenberg Approach to Mobile Robot Navigation in Unknown Environments
inferred← citeshttps://doi.org/10.1007/bf01782478openalex-snapshot
Shape transformation in space-time
inferred← citeshttps://doi.org/10.1007/s10514-016-9580-2openalex-snapshot
Velocity obstacle based local collision avoidance for a holonomic elliptic robot
inferred← citeshttps://doi.org/10.1007/s42979-020-00185-0openalex-snapshot
Probabilistic Approach to Robot Motion Planning in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/s44212-025-00081-zopenalex-snapshot
Sidewalk2Synth: generating synthetic embodied locomotion from real-world streetscapes
inferred← citeshttps://doi.org/10.1016/b978-0-443-30106-3.00022-1openalex-snapshot
Motion planning for coordinating unmanned vehicles in smart factories
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.12.023openalex-snapshot
Method of evolving junctions: A new approach to optimal control with constraints
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.02.007openalex-snapshot
Maximum thick paths in static and dynamic environments
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00408-4openalex-snapshot
Time-minimal paths amidst moving obstacles in three dimensions
inferred← citeshttps://doi.org/10.1016/s0921-8890(96)00051-6openalex-snapshot
Intelligent collision avoidance by fuzzy logic control
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.009openalex-snapshot
Extensions of Basic Motion Planning
inferred← citeshttps://doi.org/10.1017/s0263574700019111openalex-snapshot
Parallel computation of configuration space
inferred← citeshttps://doi.org/10.1017/s0263574708004888openalex-snapshot
Collision course by transformation of coordinates and plane decomposition
inferred← citeshttps://doi.org/10.1109/70.388776openalex-snapshot
Time-minimum routes in time-dependent networks
inferred← citeshttps://doi.org/10.1109/cdc.1997.657848openalex-snapshot
Geometric algorithms for conflict detection/resolution in air traffic management
inferred← citeshttps://doi.org/10.1109/icitisee48480.2019.9003896openalex-snapshot
A Novel Ant Colony optimization Algorithm for Waste Collection Problem
inferred← citeshttps://doi.org/10.1109/icra.2012.6225074openalex-snapshot
Time-optimal multi-stage motion planning with guaranteed collision avoidance via an open-loop game formulation
inferred← citeshttps://doi.org/10.1109/iros.1992.587372openalex-snapshot
Route Planning For Mobile Robots Amidst Moving Obstacles
inferred← citeshttps://doi.org/10.1109/iros.1993.583791openalex-snapshot
Motion planning amidst dynamic obstacles in three dimensions
inferred← citeshttps://doi.org/10.1109/oceans.2014.7003009openalex-snapshot
Experimental results on obstacle avoidance for high speed unmanned surface vehicles
inferred← citeshttps://doi.org/10.1109/oceanssyd.2010.5603868openalex-snapshot
Towards the use of a team of USVs for civilian harbour protection: The problem of intercepting detected menaces
inferred← citeshttps://doi.org/10.1109/robot.1992.220041openalex-snapshot
On motion planning amidst transient obstacles
inferred← citeshttps://doi.org/10.1109/robot.1993.292120openalex-snapshot
Motion planning using transient pixel representations
inferred← citeshttps://doi.org/10.1109/robot.1994.350964openalex-snapshot
Motion planning amidst planar moving obstacles
inferred← citeshttps://doi.org/10.1109/robot.2009.5152860openalex-snapshot
Time-bounded lattice for efficient planning in dynamic environments
inferred← citeshttps://doi.org/10.1109/tro.2009.2022441openalex-snapshot
Reactive Path Planning in a Dynamic Environment
inferred← citeshttps://doi.org/10.1145/1377676.1377682openalex-snapshot
Maximum thick paths in static and dynamic environments
inferred← citeshttps://doi.org/10.1163/156855393x00311openalex-snapshot
Motion planning in time-varying domains: the case of cyclic motions
inferred← citeshttps://doi.org/10.1177/0278364908097581openalex-snapshot
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles
inferred← citeshttps://doi.org/10.1177/0278364917707252openalex-snapshot
Method of evolving junctions: A new approach to optimal path-planning in 2D environments with moving obstacles
inferred← citeshttps://doi.org/10.1177/02783649922066529openalex-snapshot
Navigating a Robotic Wheelchair in a Railway Station during Rush Hour
inferred← citeshttps://doi.org/10.1177/027836499401300502openalex-snapshot
Motion Planning Amid Transient Obstacles
inferred← citeshttps://doi.org/10.1177/027836499701600605openalex-snapshot
On Motion Planning in Changing, Partially Predictable Environments
inferred← citeshttps://doi.org/10.1177/027836499801700706openalex-snapshot
Motion Planning in Dynamic Environments Using Velocity Obstacles
inferred← citeshttps://doi.org/10.2316/journal.206.2008.2.206-3123openalex-snapshot
KINEMATICS-BASED CHARACTERIZATION OF THE COLLISION COURSE
inferred← citeshttps://doi.org/10.31763/ijrcs.v2i4.816openalex-snapshot
Robotic Motion Planning in Dynamic Environments and its Applications
inferred← citeshttps://doi.org/10.3182/20100906-3-it-2019.00027openalex-snapshot
Towards the Use of a Team of USVs for Civilian Harbour Protection: USV Interception of Detected Menaces
inferred← citeshttps://doi.org/10.3390/aerospace6060068openalex-snapshot
Trajectory Planning in Time-Varying Adverse Weather for Fixed-Wing Aircraft Using Robust Model Predictive Control
inferred← citeshttps://doi.org/10.5815/ijmecs.2013.08.08openalex-snapshot
Mobile Robot Motion Using Cellular Automaton Model to Avoid Transient Obstacles
inferred← citeshttps://doi.org/10.7210/jrsj.11.1124openalex-snapshot
Special Issue: Robot Behavior. Strategy & Algorithm. Motion Strategies and Algorithms.
inferred← citeshttps://doi.org/10.7210/jrsj.15.249openalex-snapshot
On-line Motion Planning of an Autonomous Mobile Robot to Avoid Multiple Moving Obstacles Based on the Prediction of Their Future Trajectories.
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.