𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for planning transport in minimum time

✍ Scribed by S.M. Shvartin

Publisher
Elsevier Science
Year
1975
Weight
557 KB
Volume
15
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for planning β€œsensible” rou
An algorithm for planning β€œsensible” routes
✍ Ian Pratt πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 978 KB

The problem of finding an optimal route between two points in a space strewn with obstacles has been extensively studied in robotics. The standard approach to such problems is first to reduce the original geometrical specification to a finite graph of possible routes, and then to use graph-searching

An Efficient Algorithm for Minimum-Weigh
An Efficient Algorithm for Minimum-Weight Bibranching
✍ J. Keijsper; R. Pendavingh πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti