Publications related to Shortest path problem

A Single-Phase, Proximal Path-Following Framework

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis

We propose a new proximal path-following framework for a class of constrained convex problems. We consider settings where the nonlinear-and possibly nonsmooth-objective part is endowed with a proximity operator, and the constraint set is equipped with a se ...

INFORMS2018

Round Compression for Parallel Matching Algorithms

Slobodan Mitrovic, Aleksander Madry

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture th ...

ASSOC COMPUTING MACHINERY2018

Real-Time Optimizing Control of an Experimental Crosswind Power Kite

Dominique Bonvin, Grégory François, Sean Costello

The contribution of this article is to propose and experimentally validate an optimizing control strategy for power kites flying crosswind. The control strategy provides both path control (stability) and path optimization (efficiency). The path following p ...

Institute of Electrical and Electronics Engineers2018

Optimal Number of Paths with Multipath Routing in Hybrid Networks

Patrick Thiran, Sébastien Christophe Henri

In recent years, multipath routing, i.e., employing several paths simultaneously, has emerged as an efficient way to provide significant throughput gains in local networks. This has been observed both with technologies that are not subject to interference, ...

2018

Optimal Number of Paths with Multipath Routing in Hybrid Networks

Patrick Thiran, Sébastien Christophe Henri

IEEE2018

Input-Constrained Path Following for Autonomous Marine Vehicles with a Global Region of Attraction

Francisco Fernandes Castro Rego

This paper presents a solution to the problem of path following control for autonomous marine vehicles (AMVs) subject to input constraints and constant ocean current disturbances. We propose two nonlinear control strategies: the first is obtained by using ...

ELSEVIER SCIENCE BV2018

Diverse M-Best Solutions by Dynamic Programming

Michaël Unser, Virginie Sophie Uhlmann

Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best soluti ...

Springer2017

Optimal Path Planning and Coverage Control for Multi-Robot Persistent Coverage in Environments with Obstacles

Alcherio Martinoli, Zeynab Talebpour, José Manuel Palacios Gasos

Persistent coverage aims to maintain a certain coverage level over time in an environment where such level deteriorates. This level can be associated to temperature, dust or sensor information. We propose an algorithmic solution in which each robot locally ...

2017

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Shortest path problem

A Single-Phase, Proximal Path-Following Framework

Round Compression for Parallel Matching Algorithms

Traffic Receipts for Network Transparency

Real-Time Optimizing Control of an Experimental Crosswind Power Kite

Optimal Number of Paths with Multipath Routing in Hybrid Networks

Optimal Number of Paths with Multipath Routing in Hybrid Networks

Input-Constrained Path Following for Autonomous Marine Vehicles with a Global Region of Attraction

Diverse M-Best Solutions by Dynamic Programming

Optimal Path Planning and Coverage Control for Multi-Robot Persistent Coverage in Environments with Obstacles

Dynamical Efficiency in congested road networks

Graph Chatbot

Chat with Graph Search

A Single-Phase, Proximal Path-Following Framework

Round Compression for Parallel Matching Algorithms

Real-Time Optimizing Control of an Experimental Crosswind Power Kite

Input-Constrained Path Following for Autonomous Marine Vehicles with a Global Region of Attraction

Traffic Receipts for Network Transparency

Optimal Number of Paths with Multipath Routing in Hybrid Networks

Dynamical Efficiency in congested road networks

Optimal Path Planning and Coverage Control for Multi-Robot Persistent Coverage in Environments with Obstacles

Diverse M-Best Solutions by Dynamic Programming

Optimal Number of Paths with Multipath Routing in Hybrid Networks