Results 251 to 260 of about 9,005,999 (284)
Some of the next articles are maybe not open access.
Multiobjective Path Planning: Localization Constraints and Collision Probability
IEEE Transactions on Robotics, 2015We present a novel path planning algorithm that, starting from a probabilistic roadmap, efficiently constructs a product graph used to search for a near optimal solution of a multiobjective optimization problem. The goal is to find paths that minimize a primary cost, such as the path length from start to goal, subject to a bound on a secondary cost ...
Shaunak D. Bopardikar +2 more
openaire +2 more sources
Real-time local path planning for mobile robots
9th International Workshop on Robot Motion and Control, 2013This paper presents a path planning algorithm for autonomous navigation of nonholonomic mobile robots in complex environment. The irregular contour of obstacles is represented by segments. The goal of the robot is to move towards a known target while avoiding obstacles.
Ma, Yingchong +2 more
openaire +3 more sources
Sliding Local Planners for Sampling-Based Path Planning
2017 First IEEE International Conference on Robotic Computing (IRC), 2017Sampling-based path planning algorithms based on straight-line local planners, even in combination with advanced sampling strategies, occasionally perform poorly when a rigid robot needs to pass through narrow passages in the C-space. In order for a rigid robot to effectively navigate C-space narrow passages, we present two simple sliding local ...
S. M. Rayhan Rahman, Sue Whitesides
openaire +2 more sources
Multiresolution path planning with wavelets: A local replanning approach
2008 American Control Conference, 2008A path planning algorithm based on multiresolution cell decomposition of the environment using wavelets is proposed. The environment is assumed to be given by an occupancy grid at fine resolution. The algorithm constructs a cell decomposition at several levels of resolution (cell sizes) and constructs an optimal path to the destination from the current
Cowlagi, Raghvendra V. +1 more
openaire +2 more sources
Path Planning of Mobile Landmarks for Localization inWireless Sensor Networks
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06), 2006Many applications of wireless sensor networks require the sensor nodes to obtain their locations. The main idea in most localization methods has been that some nodes with known coordinates (e.g., GPS-equipped nodes) transmit beacons with their coordinates in order to help other nodes to localize themselves. A promising method that significantly reduces
Dimitrios Koutsonikolas +2 more
openaire +2 more sources
Generalized Path Corridor-based Local Path Planning for Nonholonomic Mobile Robot
2015 IEEE 18th International Conference on Intelligent Transportation Systems, 2015A new generalized path corridor-based local planner for a nonholonomic mobile robot is proposed to avoid dynamic obstacles while following the lead of a global path. Rather than applying the global path directly, the proposed local planner will transform the global path into a normative path. Then, a generalized path corridor (GPC) is constructed based
Qi Wang 0081 +4 more
openaire +2 more sources
A General Purpose Approach for Global and Local Path Planning Combination
2015 IEEE 18th International Conference on Intelligent Transportation Systems, 20151001
Andrea Signifredi +4 more
openaire +3 more sources
A heuristic approach for local path planning in 3D environments
Robotica, 2002In this paper we describe a heuristic potential based technique for solving the problem of path planning based on local information for a free flying robot (FFR) in a 3D static environment. A path which maximizes the sum of three functions: (repulsion from obstacles, attraction towards the goal, and level attraction) is chosen. While the repulsive and
openaire +1 more source
Local path planning in dynamic environments with uncertainty
Proceedings of 1994 IEEE International Conference on MFI '94. Multisensor Fusion and Integration for Intelligent Systems, 2002We address the problem of planning a safe path for a mobile robot, in the presence of moving obstacles, based on local information. We consider constraints on the speed and the acceleration of the robot. Moreover, we take into account the uncertainty in estimating the velocity of each obstacle.
A. Elnagar, A. Basu
openaire +1 more source
On the design for AGVs: Modeling, path planning and localization
2011 IEEE International Conference on Mechatronics and Automation, 2011Intelligent warehouse becomes a key component of logistics process automation, which essentially promotes the productivity and cost reduction. This paper presents a novel design solution of an Automated Guided Vehicles (AGVs) system for intelligent warehouse.
Qi Sun, Hui Liu, Qiang Yang, Wenjun Yan
openaire +1 more source