14,646 Hits in 4.0 sec

Meta-analysis of choice set generation effects on route choice model estimates and predictions

Carlo Giacomo Prato
2012 Transport  
Meta-analysis estimates suggest that transport modelers should implement stochastic path generation techniques with average variance of its distribution parameters and correction for unequal sampling probabilities  ...  A meta-analytical approach allows synthesizing the effect of judgments for the implementation of path generation techniques, since a large number of models generate a large amount of results that are otherwise  ...  Acknowledgements The author would like to thank Emma Frejinger for providing the details of the Borlange network and three anonymous reviewers for the significant contribution in improving a previous version  ... 
doi:10.3846/16484142.2012.719840 fatcat:25wdsn4fvnf7xojyzim35vattm

The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty

R. Alterovitz, T. Simeon, K. Goldberg
2007 Robotics: Science and Systems III  
compared to shortest-path plans.  ...  In this paper, we formulate SMRM and demonstrate it by generating nonholonomic plans for steerable needles, a new class of medical needles that follow curved paths through soft tissue and can be modeled  ...  include a more complex uncertainty model that considers arbitrary stochastic models for both insertion distance and radius of curvature.  ... 
doi:10.15607/rss.2007.iii.030 dblp:conf/rss/AlterovitzSG07 fatcat:tzkyo3lponb7zi3ucyuieuowfy

Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games

Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2017 Information and Computation  
modeling power for no complexity cost (decision-wise) Shortest path: harder than the worst-case, pseudo-polynomial with NP-hardness result BWC framework combines worst-case and expected value requirements  ...  a natural wish in many practical applications few existing theoretical support Mean-payoff: additional modeling power for no complexity cost (decision-wise) Shortest path: harder than the worst-case,  ...  Pseudo-polynomial algorithm: sketch 3 Compute R, the attractor of T with cost < µ = 8  ... 
doi:10.1016/j.ic.2016.10.011 fatcat:ib26vfpxojcbpezew7zns47za4

Simplicial Label Correcting Algorithms for continuous stochastic shortest path problems

Dmitry S. Yershov, Steven M. LaValle
2013 2013 IEEE International Conference on Robotics and Automation  
This paper provides a rigorous analysis as well as algorithmic and implementation details of the proposed model for the stochastic shortest path problem in continuous spaces with obstacles.  ...  A relation to a "nearby" deterministic model is shown for small time steps; the cost-to-go function of the stochastic model is approximated with that of the deterministic model, and the approximation error  ...  Thus, by discretizing X free with a simplicial complex, an approximation of the shortest path in X free (of any dimension) can be found.  ... 
doi:10.1109/icra.2013.6631300 dblp:conf/icra/YershovL13 fatcat:gnykmfekibbwlojn23zzpvpsnm

Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths [article]

Axel Parmentier
2017 arXiv   pre-print
The main contribution of this paper is to introduce a standard procedure to generate bounds on paths resources in a general setting which covers most resource constrained shortest path problems, among  ...  In that purpose, we introduce a generalization of the resource constrained shortest path problem where the resources are taken in a monoid.  ...  Acknowledgments I greatly thank my PhD advisor Frédéric Meunier for his numerous and deep remarks on the mathematics and the way to write this article.  ... 
arXiv:1504.07880v2 fatcat:4up4vrxudfa3fmgxx6gzhgkd24

A chernoff bound approximation for risk-averse integer programming

Randy Cogill, Zhou Zhou
2011 Proceedings of the 2011 American Control Conference  
For problems with totally unimodular constraint sets, this Chernoff bound can be minimized by solving a linear program.  ...  From this approach, we obtain a suboptimal solution, together with a guaranteed upper bound on the achieved exceedance probability.  ...  This is precisely the structure of the uncertainty found in a shortest path problem with stochastic edge costs, one of the main problems motivating this work. III.  ... 
doi:10.1109/acc.2011.5991543 fatcat:uhcvkibojnczfpi3tsrhg5avw4

Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries

Sejoon Lim, Christian Sommer, Evdokia Nikolova, Daniela Rus
2012 Robotics: Science and Systems VIII  
We describe an algorithm for stochastic path planning and applications to route planning in the presence of traffic delays.  ...  such that approximate stochastic shortestpath queries can be answered in poly-logarithmic time (actual worst-case bounds depend on the probabilistic model).  ...  We improve upon the state of the art in stochastic path planning, providing a method that can answer stochastic shortestpath queries in poly-logarithmic time using a data structure that occupies space  ... 
doi:10.15607/rss.2012.viii.032 dblp:conf/rss/LimSNR12 fatcat:rg4z57d5jracff7uxyjcqupwky

Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem

Lixing Yang, Xuesong Zhou
2014 Transportation Research Part B: Methodological  
Using a sample-based representation scheme to capture spatial and temporal travel time correlations, this article constructs an integer programming model for finding the a priori least expected time paths  ...  We explicitly consider the unique path constraint associated with the a priori path in a time-dependent and stochastic network, and propose a number of reformulations to establish linear inequalities that  ...  We also want to thank Yusen Chen for providing the third network and sensor data. The work presented in this paper remains the sole responsibility of the authors.  ... 
doi:10.1016/j.trb.2013.10.012 fatcat:kyhgkukkxzgqxprqpbfl3wkyki

CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time

Jean-Michel Fourneau, Nihal Pekergin, Sana Younes
2007 Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)  
We have designed a tool to partition a Markov Chain and have used the censoring technique and strong stochastic comparison to obtain bounds on rewards and the first passage time.  ...  Remember that we compute the shortest path according to a cost function but not the path with the shortest hop number.  ...  Breadth-First Search algorithm generates all the paths of length smaller than d while Shortest Path algorithm gives the path with the higher probability when the cost of link (a, b) is |log (Q(a, b) )  ... 
doi:10.1109/qest.2007.35 dblp:conf/qest/FourneauPY07 fatcat:bdycxs27pbgfvdxfj45ff6tzxy

Path complexity for observed and predicted bicyclist routes

Thomas Koch, Luk Knapen, Elenna Dugundji
2019 Procedia Computer Science  
The complexity of a given path in a graph is the minimum number of shortest paths that is required to specify that path.  ...  The complexity of a given path in a graph is the minimum number of shortest paths that is required to specify that path.  ...  Figure 1 shows the minimum decomposition for a sample path p in a graph having complexity c(p) = 3. The example shows that multiple decompositions do exist for path p. Knapen et al.  ... 
doi:10.1016/j.procs.2019.04.054 fatcat:liqtemcj5va5tjbxteduhjnfda

Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

Tao Xing, Xuesong Zhou
2011 Transportation Research Part B: Methodological  
Recently, Nie and Wu (2009a) developed solution algorithms with firstorder stochastic dominance rules for the routing problem with on-time arrival reliability.  ...  most reliable path solution through solving a sequence of standard shortest path problems.  ...  We would like to thank the California Partners for Advanced Transit and Highways (PATH) in the University of California, Berkeley and NAVTEQ Corporate for providing traffic measurement and map data of  ... 
doi:10.1016/j.trb.2011.06.004 fatcat:v2b6cnbdc5c2jd6djpcumsb2p4

Sampling of alternatives for route choice modeling

E. Frejinger, M. Bierlaire, M. Ben-Akiva
2009 Transportation Research Part B: Methodological  
Therefore, we propose an importance sampling approach to generate subsets of paths suitable for model estimation.  ...  Recently, we proposed a new paradigm for choice set generation in the context of route choice model estimation.  ...  Actually, most of the deterministic approaches can be made stochastic by using random generalized cost for the shortest path computations.  ... 
doi:10.1016/j.trb.2009.03.001 fatcat:joswkdrdkfc55phoztiepoptxm

Route choice modeling: past, present and future research directions

Carlo Giacomo Prato
2009 Journal of Choice Modeling  
and flow prediction, while past research directions illustrate larger efforts toward the enhancement of stochastic route choice models rather than toward the development of realistic choice set generation  ...  The review covers both choice set generation and choice process, since present research directions show growing interest in understanding the role of choice set size and composition on model estimation  ...  Acknowledgements The insightful comments of three anonymous reviewers provided invaluable help in the revision of a previous version of this paper.  ... 
doi:10.1016/s1755-5345(13)70005-8 fatcat:wsskh7vhezd3tkizhlueqknpbe

A hierarchical method for stochastic motion planning in uncertain environments

Michael P. Vitus, Wei Zhang, Claire J. Tomlin
2012 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems  
To address this, a novel hierarchical framework is proposed that consists of two main steps: an expected shortest path problem on an uncertain graph and a chance constrained motion planning problem.  ...  The first successful, real-time experimental demonstration of chance constrained control with uncertain constraint parameters and variables is also presented for a quadrotor equipped with a Kinect sensor  ...  ACKNOWLEDGEMENTS The authors would like to thank Patrick Bouffard for performing the system identification of the quadrotor testbed.  ... 
doi:10.1109/iros.2012.6385724 dblp:conf/iros/Vitus0T12 fatcat:2qqtgfv4bjccdnwqs55l5ehnhy

Bandits with an Edge [article]

Dotan Di Castro, Claudio Gentile, Shie Mannor
2011 arXiv   pre-print
We show that the topology of the graph plays a crucial in defining the sample complexity: graphs with a low diameter have a much better sample complexity.  ...  We analyze this problem from the perspective of sample complexity: How many queries are needed to find an approximately optimal node with probability more than 1-δ in the PAC setup?  ...  The upper bounds we have provided are certainly loose for the case of a general network.  ... 
arXiv:1109.2296v1 fatcat:rqaxdtmarzgvfpux2w3ze7yzdi
« Previous Showing results 1 — 15 out of 14,646 results