Zobrazeno 1 - 10
of 40 086
pro vyhledávání: '"shortest path problem"'
Autor:
Kasperski, Adam, Zielinski, Pawel
In this paper, the recoverable robust shortest path problem in acyclic digraphs is considered. The interval budgeted uncertainty representation is used to model the uncertain second-stage costs. The computational complexity of this problem has been o
Externí odkaz:
http://arxiv.org/abs/2410.09425
Autor:
Morozov, Savva, Marcucci, Tobia, Amice, Alexandre, Graesdal, Bernhard Paus, Bosworth, Rohan, Parrilo, Pablo A., Tedrake, Russ
The Shortest-Path Problem in Graph of Convex Sets (SPP in GCS) is a recently developed optimization framework that blends discrete and continuous decision making. Many relevant problems in robotics, such as collision-free motion planning, can be cast
Externí odkaz:
http://arxiv.org/abs/2409.19543
Autor:
Otsubo, Ritsusamuel
We solve a sequential decision-making problem under uncertainty that takes into account the failure probability of a task. This problem cannot be handled by the stochastic shortest path problem, which is the standard model for sequential decision-mak
Externí odkaz:
http://arxiv.org/abs/2409.16672
Autor:
López, Carlos Linares, Herman, Ian
The problem of finding the shortest path in a graph G(V, E) has been widely studied. However, in many applications it is necessary to compute an arbitrary number of them, k. Even though the problem has raised a lot of interest from different research
Externí odkaz:
http://arxiv.org/abs/2408.08227
Autor:
K., Vidhya1 vk3994@srmist.edu.in, A., Saraswathi1 saraswaa@srmist.edu.in, Said, Broumi2 broumisaid78@gmail.com
Publikováno v:
Neutrosophic Sets & Systems. 2024, Vol. 65, p80-100. 21p.
Autor:
Wesołowski, Adam, Piddock, Stephen
Given an undirected, weighted graph, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms in the adjacency list model that solve the problem on structured instances.
Externí odkaz:
http://arxiv.org/abs/2408.10427
Autor:
Durand, Adrien1 (AUTHOR) adrien.durand1709@gmail.com, Watteau, Timothé1 (AUTHOR), Ghazi, Georges1 (AUTHOR) adrien.durand1709@gmail.com, Botez, Ruxandra Mihaela1 (AUTHOR) adrien.durand1709@gmail.com
Publikováno v:
Mathematics (2227-7390). Oct2024, Vol. 12 Issue 19, p2995. 24p.
Autor:
Guo, Jinzuo1 (AUTHOR) guojinzuo18@nudt.edu.cn, Liu, Tianyu1 (AUTHOR) liutianyu@nudt.edu.cn, Song, Guopeng1 (AUTHOR), Guo, Bo1 (AUTHOR)
Publikováno v:
Mathematics (2227-7390). Oct2024, Vol. 12 Issue 19, p2978. 14p.