Spatial Planning: A Configuration Space Approach
From MaRDI portal
Cited in
(70)- On the problem of multiple mobile robots cluttering a workspace
- The manifold of polygons degenerated to segments
- Error analysis of spatial representation and estimation of mobile robots
- A survey of motion planning and related geometric algorithms
- Spatial scheduling optimization algorithm for block assembly in shipbuilding
- Sensor-based learning for practical planning of fine motions in robotics
- Optimal geometric modeler for robot motion planning
- Cyclides in computer aided geometric design
- Traveling the boundary of Minkowski sums.
- Robot motion planning with uncertainty in control and sensing
- Generation of configuration space obstacles: The case of moving algebraic curves
- Obstacle growing in a nonpolygonal world
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- The dynamic wave expansion neural network model for robot motion planning in time-varying environments
- Using interval arithmetic to prove that a set is path-connected
- Analysis of the Pedestrian arching at bottleneck based on a bypassing behavior model
- A random-profile approach for trajectory planning of wheeled mobile robots
- Non-commutative morphology: Shapes, filters, and convolutions
- Issues in computing contact forces for non-penetrating rigid bodies
- Developing scheduling systems for Daewoo shipbuilding: DAS project
- Modelling of kinematics of the IRb-6 manipulator
- Detecting geometric infeasibility
- Generating multiple new designs from a sketch
- Three-dimensional Euclidean distance transformation and its application to shortest path planning
- Sets of lines and cutting out polyhedral objects
- Covering Minkowski sum boundary using points with applications
- Genetic algorithms in bidisciplinary (aerodynamics/electromagnetism) optimization
- Pseudo minimum translational distance between convex polyhedra. I. Definition and properties
- Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning
- A simple path non-existence algorithm using \(C\)-obstacle query
- Geometric reasoning about assembly tools
- Qualitative rigid-body mechanics
- Controlling of a mobile robot with a trailer and its nilpotent approximation
- Assembly sequences for polyhedra
- Global path planning of mobile robots using a memetic algorithm
- Autonomous robot navigation using optimal control of probabilistic regular languages
- Geometry and search in motion planning.
- A real-time dual-arm collision avoidance algorithm for assembly
- Fuzzy distances for proximity characterization under uncertainty
- A biologically inspired neural net for trajectory formation and obstacle avoidance
- On determining optimal strategies in pursuit games in the plane
- On using LP to collision detection between a manipulator arm and surrounding obstacles
- Simplified Voronoi diagrams
- Relation between part position and kinematic freedom: an expository survey
- A geometric approach to error detection recovery for robot motion planning with uncertainty
- Motion planning algorithms for molecular simulations: a survey
- Obstacle avoidance via articulation
- Trajectory planning in \(H\)-space
- Planning among movable obstacles with artificial constraints
- Efficient distance computation in configuration space
- Distance measures on intersecting objects and their applications
- Generating a reference trajectory with defined kinematics for the IRb-6 manipulator
- A solution to the two-dimensional findpath problem
- A learning fuzzy algorithm for motion planning of mobile robots
- Stratifying high-dimensional data based on proximity to the convex hull boundary
- A search algorithm for motion planning with six degrees of freedom
- Planning for multiple measurement channels in a continuous-state POMDP
- On determining optimal strategies in pursuit games in the plane
- On information invariants in robotics
- Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles
- Randomized query processing in robot path planning
- On multiple moving objects
- Motion planning for robots with topological dimension reduction method
- The complexity of planar compliant motion planning under uncertainty
- On the connectivity of manipulator free workspace
- Mobile robot map making using sonar
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- An efficient algorithm for one-step planar compliant motion planning with uncertainty
- Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm
- Motion planning for unicycle and car-like robots
This page was built for publication: Spatial Planning: A Configuration Space Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659185)