most citedResource Constrained Pathfinding with Enhanced Bidirectional A* Search

1 citations · 1 across the 6 of their papers we have counts for

collaborators

7 papers

cs.AI2025

A Fast Heuristic Search Approach for Energy-Optimal Profile Routing for Electric Vehicles

Saman Ahmadi, Mahdi Jalili

We study the energy-optimal shortest path problem for electric vehicles (EVs) in large-scale road networks, where recuperated energy along downhill segments introduces negative ene…

cs.DS2025

Fine-Grained Classification Of Detecting Dominating Patterns

Jonathan Dransfeld, Marvin Künnemann, Mirza Redzic

We consider the following generalization of dominating sets: Let be a host graph and be a pattern graph . A dominating -pattern in is a subset of vertices in…

eess.SY2025

A Feedback Control Framework for Incentivised Suburban Parking Utilisation and Urban Core Traffic Relief

Abdul Baseer Satti, James Saunderson, Wynita Griggs +6

Urban traffic congestion, exacerbated by inefficient parking management and cruising for parking, significantly hampers mobility and sustainability in smart cities. Drivers often f…

cs.AI2025

Resource Constrained Pathfinding with A* and Negative Weights

Saman Ahmadi, Andrea Raith, Mahdi Jalili

Constrained pathfinding is a well-studied, yet challenging network optimisation problem that can be seen in a broad range of real-world applications. Pathfinding with multiple reso…

cs.AI2025

Parallelizing Multi-objective A* Search

Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith +2

The Multi-objective Shortest Path (MOSP) problem is a classic network optimization problem that aims to find all Pareto-optimal paths between two points in a graph with multiple ed…

cs.AI2024

Resource Constrained Pathfinding with Enhanced Bidirectional A* Search

Saman Ahmadi, Andrea Raith, Guido Tack +1

The classic Resource Constrained Shortest Path (RCSP) problem aims to find a cost optimal path between a pair of nodes in a network such that the resources used in the path are wit…