Výsledky vyhledávání - Relaxed Dijkstra algorithm

Path planning of intelligent mobile robot based on Dijkstra algorithm Autor Li, Xueyan

“…Under the premise of grid environment modeling method, a relaxed Dijkstra algorithm is proposed to solve the problem of real-time path planning for mobile robot in large-scale and obstacle intensive working environment…”
Získat plný text

Relaxed Dijkstra and A with linear complexity for robot path planning problems in large-scale grid environments Autor Ammar, Adel, Bennaceur, Hachemi, Châari, Imen, Koubâa, Anis, Alajlan, Maram

“… We propose two new time-linear relaxed versions of Dijkstra (RD) and A* (RA*) algorithms to solve the global path planning problem in large grid environments…”
Získat plný text

A New Method for Solving Routing and Wavelength Assignment Problems in Optical Networks Autor Guan, Xiaohong, Guo, Sangang, Zhai, Qiaozhu, Gong, Weibo, Qiao, Chunming

“… More specifically, in solving the dual subproblems after the wavelength capacity constraints are relaxed, the shortest path algorithms such as Dijkstra's typically assign the same route…”
Získat plný text

Strategies for Improving Δ-stepping Algorithm on Scale-free Graphs Autor Chen, Jun-wu, Yu, Hua-shan

“… vertex.Combining the classical Dijkstra's algorithm and Bellman-Ford's algorithm,Δ-stepping algorithm is used widely to complete SSSP computations in parallel…”
Získat plný text

More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm Autor Kainer, Michael, Jesper Larsson Träff

“…Dijkstra's algorithm for the Single-Source Shortest Path (SSSP) problem is notoriously hard to parallelize in \(o(n)\) depth, \(n…”
Získat plný text

Multiqueue-Based FPGA Routing: Relaxed A Priority Ordering for Improved Parallelism Autor Singer, Alexandre, Yan, Hang, Zhang, Guozheng, Jeffrey, Mark C., Stojilovic, Mirjana, Betz, Vaughn

“… We speed up several related shortest path algorithms (Dijkstra's, A*, and directed) by utilizing a concurrencyfriendly but weakly ordered data structure, the MultiQueue…”
Získat plný text

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers Autor Alistarh, Dan, Koval, Nikita, Giorgi Nadiradze

“… This is the case for parallel implementations of Dijkstra's single-source shortest-paths algorithm (SSSP…”
Získat plný text

Data Structures for Task-based Priority Scheduling Autor Wimmer, Martin, Cederman, Daniel, Versaci, Francesco, Jesper Larsson Träff, Tsigas, Philippas

“… (but still relaxed with regard to a sequential specification) guarantees. The parameter \(k\) allows to dynamically configure the trade-off between scalability and the required ordering guarantee…”
Získat plný text

A faster capacity scaling algorithm for minimum cost submodular flow Autor Fleischer, Lisa, Iwata, Satoru, McCormick, S. Thomas

“…We describe an O(n4hmin{logU,n2logn}) capacity scaling algorithm for the minimum cost submodular flow problem…”
Získat plný text

R(2)-heaps with suspended relaxation for manipulating priority queues and a new algorithm for reweighting graphs Autor Shrairman, Ruth

“… We attack the first problem by introducing a new data structure--Relaxed Heaps, that implements efficiently two main operations critical for the improvement of Dijkstra's shortest path algorithm. R$\sp2…”
Získat plný text

The Lock-free \(k\)-LSM Relaxed Priority Queue Autor Wimmer, Martin, Gruber, Jakob, Jesper Larsson Träff, Tsigas, Philippas

“… Priority queues are essential for many applications, e.g., Dijkstra's single-source shortest path algorithm, branch-and-bound algorithms, and prioritized schedulers…”
Získat plný text

Non-Blocking Priority Queue Based on Skiplists with Relaxed Semantics Autor Adhikari, Ashok

“… Dijkstra’s shortest path algorithm, MST algorithms, priority schedulers, and so on. Since priority queues by nature have high contention on the delete_min operation…”
Získat plný text

Fast Approximate Algorithm for the Single Source Shortest Path with Lazy Update Autor Takahashi, Tomohiro, Takashima, Yasuhiro

“…). In the conventional Dijkstra algorithm, one node with the minimum tentative distance is selected from unvisited nodes, and the tentative distances of its adjacent nodes are relaxed…”
Získat plný text

Extracting optimal paths from roadmaps for motion planning Autor Jinsuck Kim, Pearce, R.A., Amato, N.M.

“… when selecting paths from roadmaps. Our algorithm is an augmented version of Dijkstra's shortest path algorithm which allows edge weights to be defined relative to the current path…”
Získat plný text

A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D Autor Ren, Zhongqiang, Rathinam, Sivakumar, Howie Choset

“… Existing methods, such as continuous Dijkstra paradigm, can find an optimal solution by restricting the shape of the obstacles or the motion of the robot, while this work makes no such assumptions…”
Získat plný text

An efficient algorithm for the Single-Source Shortest Path Problem in graph theory Autor Tianrui Li, Luole Qi, Da Ruan

“… vertices may be queued more than once and only the source vertex and relaxed vertices are queued; the algorithm terminates when the queue is empty…”
Získat plný text

The weak-heap data structure: Variants and applications Autor Edelkamp, Stefan, Elmasry, Amr, Katajainen, Jyrki

“…The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports the operations find-min in O(1)…”
Získat plný text

Performance driven routing for modern FPGAs invited paper Autor Kannan, Parivallal, Sivaswamy, Satish

“…FPGA routing is a well studied problem. Basic point-to-point routing of nets on FPGA fabrics can be done optimally using well known shortest path algorithms like Dijkstra's and A-star…”
Získat plný text

A faster capacity scaling algorithm for minimum cost submodular flow Autor FLEISCHER, Lisa, IWATA, Satoru, McCORMICK, Thomas

“…We describe an O(n[exp.4]h min{log U, n[exp.2] log n}) capacity scaling algorithm for the minimum cost submodular flow…”
Získat plný text

Practical Concurrent Priority Queues Autor Gruber, Jakob

“… Dijkstra's shortest path algorithm) and operating system (i.e. priority schedulers). The recent trend towards multiprocessor computing requires new implementations…”
Získat plný text