Results 241 to 250 of about 3,510,500 (285)
Some of the next articles are maybe not open access.

Informative path planning with a human path constraint

2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2014
One way for a human and a robot to collaborate on a search task is for the human to specify constraints on the robot’s path and then allow the robot to find an optimal path subject to these constraints. This paper presents an anytime solution to the robot’s path-planning problem when the human specifies a path constraint and an acceptable amount of ...
Daqing Yi   +2 more
openaire   +2 more sources

Iterative accelerated A* path planning

49th IEEE Conference on Decision and Control (CDC), 2010
The paper provides a description of an iterative version of the Accelerated A* algorithm for path planning and its application in the air traffic domain for airplanes with defined motion dynamics operating in the Earth-centered, Earth-fixed coordinate system (GPS) on a spherical model of the Earth constrained by the landscape and special use airspaces (
Stepán Kopriva   +3 more
openaire   +1 more source

Path Planning for a Land Leveler

2019 IEEE/SICE International Symposium on System Integration (SII), 2019
This study proposes an algorithm to determine the route of a land leveler, which is a type of agricultural machine for leveling and flattening the surfaces of fields. First, we propose the land leveler problem (LLP), which is formulated as a combinatorial optimization problem.
Ichiho Ojima, Hisashi Date
openaire   +1 more source

Path planning for optimal classification

2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 2012
As stated in the Office of the Secretary of Defense's Unmanned Aircraft Systems Roadmap 2005–2030, reconnaissance is the number one priority mission for Unmanned Air Vehicles (UAVs) of all sizes. During reconnaissance missions, classification of objects of interest (e.g, as friend or foe) is key to mission performance.
Mariam Faied   +3 more
openaire   +2 more sources

Quasi-randomized path planning

Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2002
We propose the use of quasi-random sampling techniques for path planning in high-dimensional configuration spaces. Following similar trends from related numerical computation fields, we show several advantages offered by these techniques in comparison to random sampling.
Michael S. Branicky   +3 more
openaire   +2 more sources

Path planning for a mobile robot

IEEE Transactions on Systems, Man, and Cybernetics, 1992
Two problems for path planning of a mobile robot are considered. The first problem is to find a shortest-time, collision-free path for the robot in the presence of stationary obstacles in two dimensions. The second problem is to determine a collision-free path (greedy in time) for a mobile robot in an environment of moving obstacles. The environment is
Christos Alexopoulos, Paul M. Griffin
openaire   +1 more source

Support Vector Path Planning

2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006
This paper describes a unique approach of applying a pattern classification technique to robot path planning. A collision-free path connecting a start and a goal point provides information on the division of the space. In the case of 2D path planning, for example, the path divides the space into two regions.
openaire   +1 more source

Planning paths of minimal curvature

Proceedings of 1995 IEEE International Conference on Robotics and Automation, 2002
We consider the problem of planning curvature constrained paths amidst polygonal obstacles, connecting the given start and target configurations. Let the critical curvature R/sub c//sup -1/ be the minimal curvature for which a constrained path exists.
openaire   +1 more source

Path planning techniques for mobile robots: Review and prospect

Expert Systems With Applications, 2023
Lixing Liu
exaly  

Home - About - Disclaimer - Privacy