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 proposes a new algorithm for solving the robot path planning problem which includes finding a path from a source to a destination subject to certain constraints. First, using the overhead view of the surroundings, a free space model is created using MAKLINK graph theory. Then Dijkstra's Algorithm is applied over the MAKLINK graph to obtain a sub-optimal path. This sub-optimal path is further...
This paper proposes a novel approach in finding an optimal solution for vehicle routing. The intention here is to find the shortest time path between different points. Dijkstra's algorithm is a very popular technique used in communication networks for data routing and in path planning of robots. Normally the implementation of Dijkstra's algorithm involves initialization of weights depending upon a...
This paper considers the Euclidean shortest path problem among obstacles in ℝn. Adaptations of Dijkstra's and A* algorithms are introduced that compute the approximate cost-to-go function over a simplicial complex embedded in the free space. Interpolation methods are carefully designed and analyzed so that they are proven to converge numerically to the optimal cost-to-go function. As the result, the...
The computation of shortest path for a mobile automaton between two points in the plane is considered in this paper. An architecturally-efficient solution based on Dijkstra's algorithm is presented for this problem. Results of implementation in Xilinx FPGA are encouraging: the solution operates at approximately 46 MHz and the implementation for a graph with 64 nodes and 88 edges fits in one XCV3200E-FG1156...
In the defence domain, weapons allocation is defined to be the reactive assignment of weapon systems to engage or counter identified threats. From a command perspective, this refers to the allocation of friendly and coalition force elements (e.g. fighter aircraft, frigates etc.) to engage or interdict adversaries which are posing threats, not only to themselves, but also to defended areas and high-value...
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.