The subpath planning problem (SPP) is a branch of path planning problem, which has widespread applications in automated manufacturing process as well as vehicle and robot navigation. This problem aims to find the shortest path or tour subject to covering a set of given subpaths. By casting SPP to a graph routing problem, we propose a deterministic 2-approximation algorithm finding near optimal ...

Path planning is one of the most important issues in mobile robots since it determines the intelligence of robots. It is about finding the shortest, collision free and smooth path form predefined start point to fixed target point with the presence of obstacles either static or dynamic. In this paper, we present a new approach of artificial intelligence for mobile robot. The proposed approach fo...

This paper compares the implications of short and long horizon planning in dynamic optimization problems with the structure of a standard one-sector growth model if agents have incomplete knowledge about the production function. Agents know the output and rate of return at the current capital stock and use an estimation of the production function based on this knowledge to determine current con...

Motion planning is a key element of robotics since it empowers a robot to navigate autonomously. Particle Swarm Optimization is a simple, yet a very powerful optimization technique which has been effectively used in many complex multi-dimensional optimization problems. This paper proposes a path planning algorithm based on particle swarm optimization for computing a shortest collision-free path...

The paper focuses on the establishment of optimized bucket path planning using numerical solution method, for a force-reflecting backhoe which is affected by excavation environment including potential obstacles. The developed path planning method can be used for precise bucket control and more importantly for obstacle avoidance which is directly related to safety issues. An optimal path plannin...

The goal of collision-free path planning is to find a continuous path from a starting position to goal position without any collisions. The collision-free path planning is a critical skill in mobile robot applications, and by now it is still a tough problem because mobile robots would easily run into the situation of planning for the current path while neglecting the global goal. In this paper,...

in this paper we present a new method for tool-path generation and adaptive interpolation for a three-axis cnc milling machine. this method satisfied the force and / or the error conditions by using a variable-direction variable-feedrate strategy based on maximum feedrate map. the proposed adaptive interpolator modifies the cutting path and the moving direction according to the actual instantan...

Title of thesis: DEVELOPMENT OF A REAL-TIME HIERARCHICAL 3D PATH PLANNING ALGORITHM FOR UNMANNED AERIAL VEHICLES Matthew David Solomon, Master of Science, 2016 Thesis directed by: Dr. Huan Xu Department of Aerospace Engineering Unmanned aerial vehicles (UAVs) frequently operate in partially or entirely unknown environments. As the vehicle traverses the environment and detects new obstacles, rap...

The article addresses comparison of fuzzy BKproduct approach with A* search algorithm for optimal path finding of the autonomous underwater vehicles (AUVs). The technique is designed to accomplish two missions: obstacle avoidance using ARTMAP and fuzzy BK-product and comparison of optimal path finding with A* search algorithm. In the first mission, underwater obstacle avoidance technique has al...

In this paper, some of the relationships between optimal control and statistics are examined. In a series of earlier papers, we examined the relationship between optimal control and conventional splines and between optimal control and the statistical theory of smoothing splines. In this paper, we present a unified treatment of these two problems and extend the same framework to include the conc...