Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
International Journal of Intelligent Transportation Systems Research
Erschienen in: International Journal of Intelligent Transportation Systems Research 2/2019

04.06.2018

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

verfasst von: Elias K. Xidias

Erschienen in: International Journal of Intelligent Transportation Systems Research | Ausgabe 2/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper describes an approach for designing a (near-)optimum path for an intelligent vehicle which is moving in an urban environment cluttered with weighted regions. The vehicle is requested to move from its depot, passing through a predefined set of customers and return back to its depot. In the proposed approach, first, using an image of the Urban environment, we apply the A-star algorithm in order to construct a distance matrix between the depot and the customers and between the customers. Then, a Genetic Algorithm with special encoding is used to search for a near-optimum solution. The objective consists of designing a (near-)optimum path for an intelligent vehicle so that all the customers are served as soon as possible while simultaneously respects the kinematical constraints of the vehicle and the linked constraints of the customers e.g. the time windows. The efficiency of the developed method is investigated and discussed through characteristic simulated experiments concerning a variety of operating weighted regions.
Nächster Artikel Combining Local Search into Genetic Algorithm for Bus Schedule Coordination through Small Timetable Modifications

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

ATZelectronics worldwide

ATZlectronics worldwide is up-to-speed on new trends and developments in automotive electronics on a scientific level with a high depth of information. 

Order your 30-days-trial for free and without any commitment.

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren
Weitere Produktempfehlungen anzeigen
Literatur
1.
2.
Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM. 52(1), 25–53 (2005)MathSciNetCrossRefMATH
3.
LaValle, M.S.: Planning Algorithms. University of Illinois (2004)
4.
Mitchell, S.B., Papadimitriou, C.H.: The weighted region problem: finding shortest paths through a weighted planar subdivision. Journal of ACM. 38(1), 18–73 (1991)MathSciNetCrossRefMATH
5.
Mata, C.S., Mitchell, J.S.B.: A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract). Proceedings of the thirteenth annual symposium on Computational geometry, pages. 264–273 (1997)
6.
Reif, J., Sun, Z.: An efficient approximation algorithm for weighted region shortest path problem. Algorithmic and Computational Robotics: New Directions: The Fourth Workshop on the Algorithmic Foundations of Robotics, page. 191, (2001)
7.
E.K. Xidias, N.A. Aspragathos, “Path planning in weighted regions using the bump-surface concept”, In the Proceedings of the 2006 I*PROMS NoE Virtual International Conference on Intelligent Production Machines and Systems
8.
P. Azariadis and N. Aspragathos, “Obstacle Representation by Bump-Surface for Optimal Motion-Planning”, Journal of Robotics and Autonomous Systems, Vol 51/2–3, 129–150, 2005
9.
Qiu, L., Hsu, W.-J., Huang, S.-Y., Wang, H.: Scheduling and routing algorithms for AGVs: a survey. Int. J. Prod. Res. 40(3), 745–760 (2002)CrossRefMATH
10.
E.K. Xidias, A.C. Nearchou and N.A. Aspragathos, “Vehicle scheduling in 2D shop floor environments”, Ind. Robot. Vol.36 (2) Emerald, United Kingdom, 2009, pp. 176–183
11.
Herrero-Pérez, D., Martínez-Barberá, H.: Modeling distributed transportation systems composed of flexible automated guided vehicles in flexible manufacturing systems. IEEE Transactions on Industrial Informatics. 6(2), 166–180 (May 2010)CrossRef
12.
Vis, I.F.A.: Survey of research in the design and control of automated guided vehicle systems. Eur. J. Oper. Res. 170(3), 677–709 (2006)MathSciNetCrossRefMATH
13.
Baker, E.: An exact algorithm for the time-constrained travelling salesman problem. Oper. Res. 31(5), 938–945 (1983)CrossRefMATH
14.
Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper. Res. 35(2), 254–265 (1987)MathSciNetCrossRefMATH
15.
Tsitsiklis, J.N.: Special cases of travelling salesman and repairman problems with time windows. Networks. 22(3), 263–282 (1992)MathSciNetCrossRefMATH
16.
Ravi Raju, K., Krishnaiah Chetty, O.V.: Addressing design and control issues of AGV-based FMSs with petri net aided simulation. Comput. Integr. Manuf. Syst. 6(2), 125–134 (May 1993)CrossRef
17.
Kavraki, L., Svestka, P., Latombe, J.C., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. Proc. IEEE Int. Conf. on Robotics and Automation (ICRA). 566–580 (1996)
18.
Vougioukas, S.G.: Optimization of robots paths computed by randomized planners. In: Proc. IEEE Int. Conf. On Robot. Automat., Barcelona, Spain, pp. 2160–2165 (2005)
19.
H. Choset, K.M. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L.E. Kavraki, S. Thrun, Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press, Boston, 2005
20.
Badawy, A., Mc Innes, C.R.: Robot motion planning using hyperboloid potential functions. In: Proc. of the World Congress on Engineering, London, UK, Vol. III, July, pp. 2–4 (2007)
21.
Zhang, Sumin, et al. "Dynamic trajectory planning for vehicle autonomous driving." systems, man, and cybernetics (SMC), 2013 IEEE international conference on. IEEE, 2013
22.
23.
24.
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley Publishing Company (1989)
25.
Xidias, E.K., Azariadis, P.N.: Mission design for a group of autonomous guided vehicles. Robot. Auton. Syst. 59(1), 34–43 (2011)CrossRef
26.
Hwang, Y.K., Ahuja, N.: Gross motion planning – a survey. ACM Comput. Surv. 24(3), 219–291 (1992)CrossRef
27.
Xiao, J., Michalewicz, Z.: An evolutionary computation approach to robot planning and navigation. In: Hirota, K., Fukuda, T. (eds.) Soft Computing in Mechatronics, Springer-Verlag, Heidelberg, Germany, pp. 117–128 (2000)
28.
Nearchou, A.C.: The effect of various operators on the genetic search for large scheduling problems. Int. Journal of Production Economics. 88(2), 191–203 (2004)CrossRef
Metadaten
Titel
On Designing Near-Optimum Paths on Weighted Regions for an Intelligent Vehicle
verfasst von
Elias K. Xidias
Publikationsdatum
04.06.2018
Verlag
Springer US
Erschienen in
International Journal of Intelligent Transportation Systems Research / Ausgabe 2/2019
Print ISSN: 1348-8503
Elektronische ISSN: 1868-8659
DOI
https://doi.org/10.1007/s13177-018-0159-5

Weitere Artikel der Ausgabe 2/2019

International Journal of Intelligent Transportation Systems Research 2/2019 Zur Ausgabe

OriginalPaper

Predicting Air Quality by Integrating a Mesoscopic Traffic Simulation Model and Simplified Air Pollutant Estimation Models

OriginalPaper

Impact Analysis of Rainfall on Traffic Flow Characteristics in Beijing

OriginalPaper

Steering Control and Automatic Tuning to Compensate for Road Cant

OriginalPaper

A Hybrid and Adaptive Metaheuristic for the Rebalancing Problem in Public Bicycle Systems

OriginalPaper

Combining Local Search into Genetic Algorithm for Bus Schedule Coordination through Small Timetable Modifications

OriginalPaper

Travel Time Variability and Macroscopic Fundamental Diagram Relationships in Multimodal Networks

Premium Partner

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen. 

    Zur Marktübersicht
    Bildnachweise