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.
This paper presents a hierarchical optimal time path planning method which can handle time constraints of the optimal path in complex and dynamic environments. The optimal time path minimizes a sharp change of orientation and waiting time to avoid a collision with moving obstacle. The path generation problem is divided into three sub-problems. The first is to generate the smooth global path using...
Trajectory planning problem (TPP) of robot manipulator is a highly constrained and nonlinear optimization problem, aims to minimize the total path motion associated with obstacle avoidance. Based on some certain constraints listed in this paper. A particle swarm optimization (PSO) based algorithm is put forward to solve this issue. The proposed algorithm consists of a hybrid approach regarding SA...
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.