Suchergebnisse - Relaxed Dijkstra algorithm

Path planning of intelligent mobile robot based on Dijkstra algorithm von 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 …”
Volltext

Relaxed Dijkstra and A with linear complexity for robot path planning problems in large-scale grid environments von 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 …”
Volltext

A New Method for Solving Routing and Wavelength Assignment Problems in Optical Networks von 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 …”
Volltext

Strategies for Improving Δ-stepping Algorithm on Scale-free Graphs von 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 …”
Volltext

More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm von 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 …”
Volltext

Multiqueue-Based FPGA Routing: Relaxed A Priority Ordering for Improved Parallelism von 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 …”
Volltext

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

“… This is the case for parallel implementations of Dijkstra's single-source shortest-paths algorithm (SSSP …”
Volltext

Data Structures for Task-based Priority Scheduling von 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 …”
Volltext

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

“… We describe an O(n4hmin{logU,n2logn}) capacity scaling algorithm for the minimum cost submodular flow problem …”
Volltext

R(2)-heaps with suspended relaxation for manipulating priority queues and a new algorithm for reweighting graphs von 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 …”
Volltext

The Lock-free \(k\)-LSM Relaxed Priority Queue von 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 …”
Volltext

Non-Blocking Priority Queue Based on Skiplists with Relaxed Semantics von 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 …”
Volltext

Fast Approximate Algorithm for the Single Source Shortest Path with Lazy Update von 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 …”
Volltext

Extracting optimal paths from roadmaps for motion planning von 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 …”
Volltext

A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D von 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 …”
Volltext

An efficient algorithm for the Single-Source Shortest Path Problem in graph theory von 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 …”
Volltext

The weak-heap data structure: Variants and applications von 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) …”
Volltext

Performance driven routing for modern FPGAs invited paper von 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 …”
Volltext

A faster capacity scaling algorithm for minimum cost submodular flow von 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 …”
Volltext

Practical Concurrent Priority Queues von Gruber, Jakob

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