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 trajectory generation algorithm that efficiently computes high-performance flight trajectories that are capable of moving a quadrocopter from a large class of initial states to a given target point that will be reached at rest. The approach consists of planning separate trajectories in each of the three translational degrees of freedom, and ensuring feasibility by deriving decoupled...
A computationally effective trajectory generation algorithm of omnidirectional mobile robots is proposed. The algorithm plans a reference path based on Bézier curves for obstacle avoidance. Then the algorithm solves the problem of motion planning for the robot to track the path in a short travel time while satisfying dynamic constraints and robustness to noise. The numerical simulation demonstrates...
This paper presents a new approach for kinodynamic online motion planning for Automated Guided Vehicles (AGVs) in industrial environments. AGVs normally transport large and heavy transport units such as Euro-pallets or mesh pallets. Nowadays just-in-time inventory management and lean production requires the transport of small transportation units. Thus a flexible material flow is needed that can not...
Vehicles that cross lanes of traffic encounter the problem of navigating around dynamic obstacles under actuation constraints. This paper presents an optimal, exact, polynomial-time planner for optimal bounded-acceleration trajectories along a fixed, given path with dynamic obstacles. The planner constructs reachable sets in the path-velocity-time (PVT) space by propagating reachable velocity sets...
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.