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.
Collision free navigation in dynamic environments, where motion of moving obstacles is unknown, still presents a significant challenge. Sampling based algorithms are well known for their simplicity and are widely used in many real time motion planning problems. While many sampling based algorithms for dynamic environments exist, assumptions taken by these algorithms such as known trajectories of moving...
This paper presents a simple yet efficient dynamic path planning algorithm based on biphasic ant colony algorithm with fuzzy control in the environment with some dynamic obstacles. A global optimal path is planned by using the Biphasic ACO (BACO) searching algorithm without consideration of any dynamic obstacles to solve the problem of local optimization. On that basis, the fuzzy control with human...
This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires reasoning about the future system evolution and the uncertainty associated with obstacles and moving agents in the environment. This paper presents a novel procedure to account for future information gathering (and the quality...
In this paper we present a topological map building algorithm based on a Vocabulary Tree that is robust to features present in dynamic or similar environments. The algorithm recognises incorrect loop closures, not supported by the odometry, and uses this information to update the feature weights in the tree to suppress further associations from these features. Two methods of adjusting these feature...
Man has always tried to make new systems, which can do his difficult tasks. Manage and control of such new complex systems is new challenge in our life. Today, one solution to deal with this challenge is using advantage of features of autonomy. It means that instead of managing and controlling the entire system, each component or at least part of the system can manage or control itself even in unpredictable...
A novel progressive genetic algorithm is developed for motion planning of a three-limbed robot. The proposed motion planning method can be used to find a optimal joints trajectory from the initial to the final position and orientation. On the basis of the genetic algorithm a kind of variable structure genetic algorithm is proposed to solve the problem of motion planning of the three-limbed in dynamic...
A path planning algorithm of robot is proposed based on ensemble algorithm of the learning classifier system, which design fitness function in dynamic environment. The paper derived and proved that ensemble algorithm is convergence and provided a theoretical guarantee for the path planning algorithm. Simulation results also showed that genetic algorithms and learning classifier system combination...
Nowadays, mobile robots work under the dynamic environments like manufacturing industries with machinery parts as moving objects and are using many techniques for navigation, obstacle avoidance, and localization. In this work we are using pioneer 2 DX mobile robot for experiments. This paper focuses on development of algorithms with the integration of path planning by potential field method and Monte...
This paper proposes a simulated annealing based approach to determine the optimal or near-optimal path quickly for a mobile robot in dynamic environments with static and dynamic obstacles. The approach uses vertices of the obstacles to define the search space. It processes off-line computation based on known static obstacles, and re-computes the route online if a moving obstacle is detected. The contributions...
The objective of this research is to propose passage route navigation algorithms by which a holon-type mobile robot finds an optimal passage route to catch up with a moving target while avoiding moving obstacles. In this context, ldquoholon-typerdquo means ldquofree of directional constraints in motionrdquo. The authors have developed efficient algorithms under the dynamic environments, based on the...
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.