On Designing Near-Optimum Paths on Weighted Regions for an Intelligent Vehicle

Xidias, Elias K.

doi:10.1007/s13177-018-0159-5

Cited by 5 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors conclude that dynamic rerouting typically should only be employed during rush hours, for long routes that pass through some very specific road segments. Clearly, location and traffic awareness is essential also in case of AVs, as shown by Sarker et al (2020), and it is nearly indispensable in freight transport, as demonstrated by Xidias (2019). The latter statement is corroborated by Tsekeris (2022), who reports that a good portion of global freight transport is realized in urban road networks.…”

Section: Related Literaturementioning

confidence: 85%

Choosing Routes in Urban Areas that are Robust Against Minor Nonrecurring Traffic Incidents

Fazekas,

Obaid,

Gáspár

2024

Period. Polytech. Transp. Eng.

View full text Add to dashboard Cite

The paper looks at certain vehicle-level re-routing issues within urban road networks, and related network-level traffic management issues. These arise mostly when the traffic along a route of significance is hindered, slowed down, or even blocked because of some – possibly minor – unexpected, nonrecurring traffic incident at a sensitive road location, or road section. Considerations for planning routes in urban areas – routes that are in some sense robust against such incidents – are presented herein. Also, the on–the–spot detection of traffic queues by an ego-vehicle – relying on data streams from on-board visual line-of-sight (LoS) exteroceptive sensors watching, scanning and monitoring the ego-vehicle's road environment, and by some on-board dedicated real-time detection systems processing and analyzing the incoming data streams – is touched upon. However, this traffic congestion avoidance and mitigating approach – effectuated either by individual autonomous vehicles, or by human drivers – presumes availability of alternative routes, which is not the case for a good portion of the route considered. A route planning approach that could be used for routes with such critical sections is proposed and motivated through an example of an urban route of significance.

show abstract

Section: Related Literaturementioning

confidence: 85%

Choosing Routes in Urban Areas that are Robust Against Minor Nonrecurring Traffic Incidents

Fazekas,

Obaid,

Gáspár

2024

Period. Polytech. Transp. Eng.

View full text Add to dashboard Cite

show abstract

“…Magdy et al (2017) apply various metaheuristics algorithms in order to solve the path planning problem of autonomous vehicles. Xidias (2018) uses the modified Genetic Algorithm to solve routing and task scheduling problem simultaneously by using the constructed matrix. Rahul (2020) proposes a co-evolutionary for very complex mission planning.…”

Section: Introductionmentioning

confidence: 99%

Energy efficient routing and task scheduling for autonomous transfer vehicles in intra logistics

Sarıçiçek

Keser

Cibi

et al. 2021

KJS publishes peer-review articles in Mathematics, Computer Sci

View full text Add to dashboard Cite

Autonomous Transfer Vehicles (ATVs) are becoming increasingly prevalent in intra logistics. Industry 4.0 is bringing us closer to the efficient routing and scheduling of autonomous multi robot systems which perform transportation tasks. In this study, an energy efficient routing and scheduling system is proposed to minimize the total energy that the vehicles spend. Not only travelled distance but also the load of the vehicle is considered between two points. The routes of vehicles are obtained by using the proposed Hybrid Simulated Annealing Algorithm. An algorithm for the initial solution is also proposed for determining of the minimum number of vehicles for pickup and delivery requests. The performance of the algorithm is compared with the best solutions of the test problems in the literature. Besides, the proposed energy efficient routing and task scheduling model is compared with the classical distance model for routing and scheduling with backhauls. An analysis of trade-offs between energy and distance is proposed for intra logistics.

show abstract

“…The heuristic approaches of Group (2), are more advantageous for quickly finding a solution than for finding veryclose optimum path. Such methods can be found in (Kindl and Rowe 2012) that uses a heuristic search combined with simulated annealing, and in (Xidias 2019) that uses a genetic algorithm to solve WRP constrained by a list of points that a path needs to cross.…”

Section: Introductionmentioning

confidence: 99%

“…While the use of Steiner points is a common approach for solving WRP in geometry, gridbased methods are widely used in robotics. These methods are practical and some can be combined with other constraints, such as (Jaklin, Tibboel, and Geraerts 2014;Xidias 2019;Zheng et al 2010;Szczerba, Chen, and John J. Uhran 1998). If, however, a particular application requires the computation of very-close optimum path, the resolution of the cell grids or the density of Steiner points on region edges must be large.…”

Section: Introductionmentioning

confidence: 99%

Computing Close to Optimal Weighted Shortest Paths in Practice

Tran

Dinneen

Linz

2020

ICAPS

View full text Add to dashboard Cite

This paper proposes a new practical method for the weighted region problem (WRP). The objective of WRP is to find a minimum cost path between two vertices among different regions where each region incurs a traversal cost per unit distance. Currently, there is no practical algorithm that solves this problem exactly. Among the approximation methods that solve instances of WRP, there is a limited number of algorithms that compute paths whose lengths are close to optimal, which we call very-close optimum paths. However, they are considered as theoretical methods. On the other hand, algorithms for solving WRP that can be applied to practical data sets (using decomposition ideas or heuristics) are not guaranteed to find a very-close optimum path within an acceptable amount of time. In this paper, we consider an alternative method for solving WRP that exploits Snell's law of physical refraction. We compare the performance of our new algorithm with that of two existing algorithms, using at least 500 test cases for each such comparison. The experimental results show that our algorithm returns a very-close optimum weighted shortest path in reasonable time.

show abstract

On Designing Near-Optimum Paths on Weighted Regions for an Intelligent Vehicle

Cited by 5 publications

References 18 publications

Choosing Routes in Urban Areas that are Robust Against Minor Nonrecurring Traffic Incidents

Choosing Routes in Urban Areas that are Robust Against Minor Nonrecurring Traffic Incidents

Energy efficient routing and task scheduling for autonomous transfer vehicles in intra logistics

Computing Close to Optimal Weighted Shortest Paths in Practice

Contact Info

Product

Resources

About