The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In view of the shortcomings of the previous genetic algorithm in solving the problem of path planning of robot, this paper has improved it on the basis of the traditional genetic algorithm. The environment model is built by the grids and the fixed length serial number coding is used to encode. The random search method and the ascending order method are combined to generate the initial population....
The paper deals with the optimization of local path for the mobile robot, whereas the safety of the route is the major criterion. The robot equipped with differential chassis with kinematic constraints is considered for the task. The optimization is based on genetic algorithm (GA), optimizing the polyline representation of the path. The core idea of the method presented is to sequentially increase...
Based on the characteristic of autonomous underwater vehicle path planning, the method of path planning was analyzed by genetic algorithm. Firstly, by means of grid, plan space was modeled into two markers. Best path was searched by genetic algorithm. Method of giving birth to initial groups was improved. Sufficiency function of path planning was given. Chamfer operator in genetic algorithm was imported...
In the path planning and its execution, a path must be defined from a source point to a destination point and then the navigation control task is executed. This study proposes a new method of novelty detection, named NDN (Novelty Detection with Normalized Compression Distance), to contribute in the navigation control of mobile robots. First, a genetic algorithm for path planning, based on a topological...
Path planning in quadrotor-typed UAV is essential in navigating from initial to destination point. This will minimize the power consumption of the vehicle which is important to avoid wasted energy in a given amount of time. This paper will use Genetic Algorithm (GA) to determine the shortest path that the quadrotor must travel given one target point to save energy and time without hitting an obstacle...
Path planning is one of the most exciting challenges in building autonomous swarm robots. It consists on finding a route from the origin of the robot to its target destination. It becomes more difficult when some obstacles are added to the environment. This paper consists of multiple obstacles: the robots and their possible path. This paper will present the path planning of underwater swarm robot...
Path planning and execution are very important tasks for autonomous mobile robots. In the environment considered in this study, first the path must be planned from a source point to a destination point. Next, the control navigation is executed from a set of possible actions. Several works based on metric map can be found in the literature. This paper address an approach in which a path as a sequence...
Multi-objective formulations are realistic models for many complex engineering optimization problems. In many real-life problems, objectives under consideration conflict with each other, and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other objectives. This paper presents a genetic algorithm (GA) specifically for problems...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.