Skip to main content
Top

2019 | OriginalPaper | Chapter

6. Zusammenfassung und Ausblick

Author : Sebastian Feld

Published in: Alternative Routen in komplexen Umgebungen

Publisher: Springer Fachmedien Wiesbaden

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Zusammenfassung

Alternative Routen kommen nicht nur in Straßennetzen zur Anwendung, sondern auch in komplexen Umgebungen. Potentielle Anwender sind beispielsweise Besucher eines Flughafens mit unterschiedlich viel Zeit bis zum Boarding, Einsatzkräfte der Feuerwehr oder der Polizei, die blockierten Flächen ausweichen müssen, autonome mobile Roboter in Lagerhäusern, die Pakete sammeln und lagern, und Nicht-Spieler-Charaktere in Computerspielen, die auf sinnvolle und gleichzeitig unvorhersehbare Art und Weise agieren. Darüber hinaus kann ein Navigationssystem durch das Präsentieren von alternativen Routen Anwender dazu bringen, einen bereits stark frequentierten Bereich zu umgehen und Überfüllungen proaktiv zu vermeiden. Die beschriebenen Gedanken stellen die Ausgangslage des vorliegenden Buches dar. Sie behandeln Ansätze, die alternative Routen in komplexen Umgebungen definieren, berechnen, vergleichen und für weitere Analysen verwenden. In diesem Kapitel werden die Ergebnisse des vorliegenden Buches zusammengefasst und es wird ein Ausblick auf künftige Forschungsfragen gegeben.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

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!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Back, T. (1996). Evolutionary algorithms in theory and practice: Evolution strategies, evolutionary programming, genetic algorithms. New York: Oxford University Press.MATH Back, T. (1996). Evolutionary algorithms in theory and practice: Evolution strategies, evolutionary programming, genetic algorithms. New York: Oxford University Press.MATH
2.
go back to reference Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016). Route planning in transportation networks. In Algorithm engineering (S. 19–80). Springer. Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016). Route planning in transportation networks. In Algorithm engineering (S. 19–80). Springer.
3.
go back to reference Bengio, Y., Courville, A., & Vincent, P. (2013). Representation learning: A review and new perspectives. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(8), 1798–1828.CrossRef Bengio, Y., Courville, A., & Vincent, P. (2013). Representation learning: A review and new perspectives. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(8), 1798–1828.CrossRef
4.
go back to reference Bespamyatnikh, S. (2003) Computing homotopic shortest paths in the plane. In Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms. Society for industrial and applied mathematics (S. 609–617).MathSciNetCrossRef Bespamyatnikh, S. (2003) Computing homotopic shortest paths in the plane. In Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms. Society for industrial and applied mathematics (S. 609–617).MathSciNetCrossRef
5.
go back to reference Bonin-Font, F., Ortiz, A., & Oliver, G. (2008). Visual navigation for mobile robots: A survey. Journal of Intelligent and Robotic Systems, 53(3), 263–296.CrossRef Bonin-Font, F., Ortiz, A., & Oliver, G. (2008). Visual navigation for mobile robots: A survey. Journal of Intelligent and Robotic Systems, 53(3), 263–296.CrossRef
6.
go back to reference Cambridge Vehicle Information Technology Ltd. (2013). Choice routing. Cambridge Vehicle Information Technology Ltd. (2013). Choice routing.
7.
go back to reference Chambers, E. W., Verdiere, E. C. D., Erickson, J., Lazard, S., Lazarus, F., & Thite, S. (2010). Homotopic fréchet distance between curves or, walking your dog in the woods in polynomial time. Computational Geometry, 43(3), 295–311.MathSciNetCrossRef Chambers, E. W., Verdiere, E. C. D., Erickson, J., Lazard, S., Lazarus, F., & Thite, S. (2010). Homotopic fréchet distance between curves or, walking your dog in the woods in polynomial time. Computational Geometry, 43(3), 295–311.MathSciNetCrossRef
8.
go back to reference Daneshpajouh, S., & Ghodsi, M. (2011). A heuristic homotopic path simplification algorithm. In International conference on computational science and its applications (S. 132–140). Springer. Daneshpajouh, S., & Ghodsi, M. (2011). A heuristic homotopic path simplification algorithm. In International conference on computational science and its applications (S. 132–140). Springer.
9.
go back to reference Deleuran, L. (2012) Homotopic Polygonal Line: Simplification. PhD thesis, Department Office Computer Science, Aarhus University. Deleuran, L. (2012) Homotopic Polygonal Line: Simplification. PhD thesis, Department Office Computer Science, Aarhus University.
10.
go back to reference Delling, D., Dibbelt, J., Pajor, T., Wagner, D., & Werneck, R. F. (2013). Computing multimodal journeys in practice. In Proceedings of the 12th International symposium on experimental algorithms (SEA 2013) (S. 260–271). Springer. Delling, D., Dibbelt, J., Pajor, T., Wagner, D., & Werneck, R. F. (2013). Computing multimodal journeys in practice. In Proceedings of the 12th International symposium on experimental algorithms (SEA 2013) (S. 260–271). Springer.
11.
go back to reference Delling, D., Katz, B., & Pajor, T. (2012). Parallel computation of best connections in public transportation networks. Journal of Experimental Algorithmics (JEA), 17, 4.1–4.26.MathSciNetMATH Delling, D., Katz, B., & Pajor, T. (2012). Parallel computation of best connections in public transportation networks. Journal of Experimental Algorithmics (JEA), 17, 4.1–4.26.MathSciNetMATH
12.
go back to reference Dorigo, M., & Di Caro, G. (1999) Ant colony optimization: A new meta-heuristic. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC) (Bd. 2, S. 1470–1477). IEEE Dorigo, M., & Di Caro, G. (1999) Ant colony optimization: A new meta-heuristic. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC) (Bd. 2, S. 1470–1477). IEEE
13.
go back to reference Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2000). Topological persistence and simplification. In Proceedings of the 41st annual symposium on foundations of computer science (S. 454–463). IEEE. Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2000). Topological persistence and simplification. In Proceedings of the 41st annual symposium on foundations of computer science (S. 454–463). IEEE.
14.
go back to reference Efrat, A., Kobourov, S. G., & Lubiw, A. (2006). Computing homotopic shortest paths efficiently. Computational Geometry, 35(3), 162–172.MathSciNetCrossRef Efrat, A., Kobourov, S. G., & Lubiw, A. (2006). Computing homotopic shortest paths efficiently. Computational Geometry, 35(3), 162–172.MathSciNetCrossRef
15.
go back to reference Elfes, A. (1989). Using occupancy grids for mobile robot perception and navigation. Computer, 22(6), 46–57.CrossRef Elfes, A. (1989). Using occupancy grids for mobile robot perception and navigation. Computer, 22(6), 46–57.CrossRef
16.
go back to reference Manuel, J. A., & Eugster. (2012). Archetypal analysis: Mining the extreme, HIIT Seminar, Helsinki Institute for Information Technology. Manuel, J. A., & Eugster. (2012). Archetypal analysis: Mining the extreme, HIIT Seminar, Helsinki Institute for Information Technology.
17.
go back to reference Fraichard, T. (1991). Smooth trajectory planning for a car in a structured world. In Proceedings of the 1991 IEEE international conference on robotics and automation (S. 318–323). IEEE. Fraichard, T. (1991). Smooth trajectory planning for a car in a structured world. In Proceedings of the 1991 IEEE international conference on robotics and automation (S. 318–323). IEEE.
18.
go back to reference Gartner, G., Cartwright, W., & Peterson, M. P. (Hrsg.). (2007). Location based services and telecartography. Heidelberg: Springer Science & Business Media. Gartner, G., Cartwright, W., & Peterson, M. P. (Hrsg.). (2007). Location based services and telecartography. Heidelberg: Springer Science & Business Media.
19.
go back to reference Gartner, G., & Ortag, F. (Hrsg.). (2012). Advances in location-based services. Heidelberg: Springer. Gartner, G., & Ortag, F. (Hrsg.). (2012). Advances in location-based services. Heidelberg: Springer.
20.
go back to reference Gartner, G., & Rehrl, K. (Hrsg.). (2009). Location based services and telecartography II: From sensor fusion to context models. Heidelberg: Springer. Gartner, G., & Rehrl, K. (Hrsg.). (2009). Location based services and telecartography II: From sensor fusion to context models. Heidelberg: Springer.
21.
go back to reference Helbing, D., Molnár, P., Farkas, I. J., & Bolay, K. (2001). Self-organizing pedestrian movement. Environment and Planning B: Planning and Design, 28(3), 361–383.CrossRef Helbing, D., Molnár, P., Farkas, I. J., & Bolay, K. (2001). Self-organizing pedestrian movement. Environment and Planning B: Planning and Design, 28(3), 361–383.CrossRef
22.
go back to reference Hershberger, J., & Snoeyink, J. (1994). Computing minimum length paths of a given homotopy class. Computational Geometry, 4(2), 63–97.MathSciNetCrossRef Hershberger, J., & Snoeyink, J. (1994). Computing minimum length paths of a given homotopy class. Computational Geometry, 4(2), 63–97.MathSciNetCrossRef
23.
go back to reference Hughes, N., Pinchin, J., Brown, M., & Shaw, D. (2015). Navigating in large hospitals. In Proceedings of the 6th international conference on Indoor Positioning and Indoor Navigation (IPIN 2015) (S. 1–9). IEEE. Hughes, N., Pinchin, J., Brown, M., & Shaw, D. (2015). Navigating in large hospitals. In Proceedings of the 6th international conference on Indoor Positioning and Indoor Navigation (IPIN 2015) (S. 1–9). IEEE.
24.
go back to reference ICA Commission on Location-Based Services. (2016). Lbs research agenda: Key problems (draft). ICA Commission on Location-Based Services. (2016). Lbs research agenda: Key problems (draft).
25.
go back to reference Itti, L., & Baldi, P. (2009). Bayesian surprise attracts human attention. Vision Research, 49(10), 1295–1306.CrossRef Itti, L., & Baldi, P. (2009). Bayesian surprise attracts human attention. Vision Research, 49(10), 1295–1306.CrossRef
26.
go back to reference Jenkins, K. D. (1991). The shortest path problem in the plane with obstacles: A graph modeling approach to producing finite search lists of homotopy classes. PhD thesis, Monterey, California. Naval Postgraduate School. Jenkins, K. D. (1991). The shortest path problem in the plane with obstacles: A graph modeling approach to producing finite search lists of homotopy classes. PhD thesis, Monterey, California. Naval Postgraduate School.
27.
go back to reference Katsikouli, P., Sarkar, R., & Gao, J. (2014) Persistence based online signal and trajectory simplification for mobile devices. In Proceedings of the 22nd ACM SIGSPATIAL international conference on advances in geographic information systems (S. 371–380). ACM. Katsikouli, P., Sarkar, R., & Gao, J. (2014) Persistence based online signal and trajectory simplification for mobile devices. In Proceedings of the 22nd ACM SIGSPATIAL international conference on advances in geographic information systems (S. 371–380). ACM.
28.
go back to reference Krisp, J. M. (Hrsg.). (2013). Progress in location-based services. Heidelberg: Springer. Krisp, J. M. (Hrsg.). (2013). Progress in location-based services. Heidelberg: Springer.
29.
go back to reference Krisp, J. M., & Meng, L. (2013). Going local: evolution of location based services. In Progress in Location-Based Services (S. 11–15). Springer. Krisp, J. M., & Meng, L. (2013). Going local: evolution of location based services. In Progress in Location-Based Services (S. 11–15). Springer.
30.
go back to reference Küpper, A. (2005). Location-based services: Fundamentals and operation. Chichester: Wiley.CrossRef Küpper, A. (2005). Location-based services: Fundamentals and operation. Chichester: Wiley.CrossRef
31.
go back to reference Laumond, J. P. (1987) Finding collision-free smooth trajectories for a non-holonomic mobile robot. In Proceedings of the 10th International Joint Conferences on Artificial Intelligence (IJCAI 1987) (Bd. 10, S. 1120–1123). Laumond, J. P. (1987) Finding collision-free smooth trajectories for a non-holonomic mobile robot. In Proceedings of the 10th International Joint Conferences on Artificial Intelligence (IJCAI 1987) (Bd. 10, S. 1120–1123).
32.
go back to reference Moravec, H., & Elfes, A. (1985). High resolution maps from wide angle sonar. In Proceedings of the 1985 IEEE international conference on robotics and automation (Bd. 2, S. 116–121). IEEE. Moravec, H., & Elfes, A. (1985). High resolution maps from wide angle sonar. In Proceedings of the 1985 IEEE international conference on robotics and automation (Bd. 2, S. 116–121). IEEE.
33.
go back to reference Ranganathan, A., & Dellaert, F. (2009). Bayesian surprise and landmark detection. In Proceedings of the 2009 IEEE International Conference on Robotics and Automation (IEEE ICRA 2009) (S. 2017–2023). IEEE. Ranganathan, A., & Dellaert, F. (2009). Bayesian surprise and landmark detection. In Proceedings of the 2009 IEEE International Conference on Robotics and Automation (IEEE ICRA 2009) (S. 2017–2023). IEEE.
34.
go back to reference Ruppel, P., Gschwandtner, F., Schindhelm, C. K., & Linnhoff-Popien, C. (2009). Indoor navigation on distributed stationary display systems. In Proceedings of the 33rd IEEE international Computer Software and Applications Conference (COMPSAC 2009) (S. 37–44). IEEE. Ruppel, P., Gschwandtner, F., Schindhelm, C. K., & Linnhoff-Popien, C. (2009). Indoor navigation on distributed stationary display systems. In Proceedings of the 33rd IEEE international Computer Software and Applications Conference (COMPSAC 2009) (S. 37–44). IEEE.
35.
go back to reference Thrun, S. (1998). Learning metric-topological maps for indoor mobile robot navigation. Artificial Intelligence, 99(1), 21–71.CrossRef Thrun, S. (1998). Learning metric-topological maps for indoor mobile robot navigation. Artificial Intelligence, 99(1), 21–71.CrossRef
36.
go back to reference Thrun, S. (2003). Learning occupancy grid maps with forward sensor models. Autonomous Robots, 15(2), 111–127.CrossRef Thrun, S. (2003). Learning occupancy grid maps with forward sensor models. Autonomous Robots, 15(2), 111–127.CrossRef
37.
go back to reference Werner, M., & Kiermeier, M. (2016). A low-dimensional feature vector representation for alignment-free spatial trajectory analysis. In Proceedings of the 5th ACM SIGSPATIAL international workshop on mobile geographic information systems (S. 19–26). ACM. Werner, M., & Kiermeier, M. (2016). A low-dimensional feature vector representation for alignment-free spatial trajectory analysis. In Proceedings of the 5th ACM SIGSPATIAL international workshop on mobile geographic information systems (S. 19–26). ACM.
38.
go back to reference Yu, H.-J., & Huang, D.-S. (2013). Normalized feature vectors: A novel alignment-free sequence comparison method based on the numbers of adjacent amino acids. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 10(2), 457–467.MathSciNetCrossRef Yu, H.-J., & Huang, D.-S. (2013). Normalized feature vectors: A novel alignment-free sequence comparison method based on the numbers of adjacent amino acids. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 10(2), 457–467.MathSciNetCrossRef
39.
go back to reference Zheng, Y., & Zhou, X. (2011). Computing with spatial trajectories. New York: Springer Science & Business Media.CrossRef Zheng, Y., & Zhou, X. (2011). Computing with spatial trajectories. New York: Springer Science & Business Media.CrossRef
Metadata
Title
Zusammenfassung und Ausblick
Author
Sebastian Feld
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-658-26270-9_6

Premium Partner