English
Related papers

Related papers: Line Planning in Public Transport: Bypassing Line …

200 papers

In this paper, we focus on the different traffic flow models that exist in literature. Due to our frequently encountered confusion among traffic engineers and policy makers, this paper goes into more detail about transportation planning…

Physics and Society · Physics 2009-09-29 Sven Maerivoet , Bart De Moor

Path planning is an essential component of autonomous driving. A global planner is responsible for the high-level planning. It basically performs a shortest-path search on a known map, thereby defining waypoints used to control the local…

Robotics · Computer Science 2024-10-11 Akshay Dhonthi , Nicolas Schischka , Ernst Moritz Hahn , Vahid Hashemi

Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polynomially solvable. Yet, in practice, a semidefinite program is…

Optimization and Control · Mathematics 2023-11-17 Daniel Porumbel

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it…

Disordered Systems and Neural Networks · Physics 2007-05-23 Gang Yan , Tao Zhou , Bo Hu , Zhong-Qian Fu , Bing-Hong Wang

We devise a method to exactly compute the length of the longest simple path in factored state spaces, like state spaces encountered in classical planning. Although the complexity of this problem is NEXP-Hard, we show that our method can be…

Artificial Intelligence · Computer Science 2021-03-02 Mohammad Abdulaziz , Dominik Berger

While motion planning approaches for automated driving often focus on safety and mathematical optimality with respect to technical parameters, they barely consider convenience, perceived safety for the passenger and comprehensibility for…

Robotics · Computer Science 2019-05-14 Maximilian Naumann , Martin Lauer , Christoph Stiller

This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is…

Logic in Computer Science · Computer Science 2015-07-01 Martin Avanzini , Georg Moser

We study a transportation problem where two heavy-duty trucks travel across the national highway from separate origins to destinations, subject to individual deadline constraints. Our objective is to minimize their total fuel consumption by…

Systems and Control · Electrical Eng. & Systems 2022-10-06 Wenjie Xu , Titing Cui , Minghua Chen

Path planning for 3D solid objects is a challenging problem, requiring a search in a six-dimensional configuration space, which is, nevertheless, essential in many robotic applications such as bin-picking and assembly. The commonly used…

Robotics · Computer Science 2026-01-09 Michal Minařík , Vojtěch Vonásek , Robert Pěnička

As efficient traffic-management platforms, public vehicle (PV) systems are envisioned to be a promising approach to solving traffic congestions and pollutions for future smart cities. PV systems provide online/dynamic peer-to-peer…

Artificial Intelligence · Computer Science 2017-12-29 Ming Zhu , Xiao-Yang Liu , Xiaodong Wang

Linear programming is a powerful method in combinatorial optimization with many applications in theory and practice. For solving a linear program quickly it is desirable to have a formulation of small size for the given problem. A useful…

Data Structures and Algorithms · Computer Science 2019-02-28 Hans Raj Tiwary , Victor Verdugo , Andreas Wiese

While many classes of cutting-planes are at the disposal of integer programming solvers, our scientific understanding is far from complete with regards to cutting-plane selection, i.e., the task of selecting a portfolio of cutting-planes to…

Optimization and Control · Mathematics 2018-05-09 Santanu S. Dey , Marco Molinaro

We consider a class of fixed-charge transportation problems over graphs. We show that this problem is strongly NP-hard, but solvable in pseudo-polynomial time over trees using dynamic programming. We also show that the LP formulation…

Optimization and Control · Mathematics 2015-11-26 Gustavo Angulo , Mathieu Van Vyve

Optimal path planning is prone to convergence to local, rather than global, optima. This is often the case for mobile manipulators due to nonconvexities induced by obstacles, robot kinematics and constraints. This paper focuses on planning…

Robotics · Computer Science 2025-10-09 Rufus Cheuk Yin Wong , Mayank Sewlia , Adrian Wiltz , Dimos V. Dimarogonas

Linear programming is the seminal optimization problem that has spawned and grown into today's rich and diverse optimization modeling and algorithmic landscape. This article provides an overview of the recent development of first-order…

Optimization and Control · Mathematics 2024-03-22 Haihao Lu

Motivated by the change in mobility patterns, we present a scheduling approach for a vehicle-sharing problem, considering several alternative modes of transport, from a company viewpoint with centralized planning. We consider…

Other Computer Science · Computer Science 2022-09-29 Miriam Enzi , Sophie N. Parragh , David Pisinger

Traffic engineering (TE) is a fundamental task in networking. Conventionally, traffic can take any path connecting the source and destination. Emerging technologies such as segment routing, however, use logical paths going through a…

Networking and Internet Architecture · Computer Science 2019-09-27 George Trimponias , Yan Xiao , Xiaorui Wu , Hong Xu , Yanhui Geng

The scientific community is able to present a new set of solutions to practical problems that substantially improve the performance of modern technology in terms of efficiency and speed of computation due to the advancement in neural…

Artificial Intelligence · Computer Science 2022-07-05 Salim Janji , Adrian Kliks

In the smart grid, the intent is to use flexibility in demand, both to balance demand and supply as well as to resolve potential congestion. A first prominent example of such flexible demand is the charging of electric vehicles, which do…

Computational Complexity · Computer Science 2024-03-14 Mathijs de Weerdt , Michael Albert , Vincent Conitzer

We study the complexity of the directed periodic temporal graph realization problem. This work is motivated by the design of periodic schedules in public transport with constraints on the quality of service. Namely, we require that the…

Data Structures and Algorithms · Computer Science 2025-09-15 Julia Meusel , Matthias Müller-Hannemann , Klaus Reinhardt