Skip to main content

Map Drawing Based on a Resource-Constrained Search for a Navigation System

  • Conference paper
  • First Online:
Local Search for Planning and Scheduling (LSPS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2148))

Included in the following conference series:

  • 667 Accesses

Abstract

In this paper, we propose a map drawing method based on route-finding for a navigation system. To find a route, repeated searches expand branches from the current node to successive nodes until the goal node is reached. When the search space resulting from this process is drawn on a two-dimensional plane, we can regard it as a route map to a goal. We applied our method to a palm-top navigation system and developed a Resource-Constrained Heuristic Search (RCS) for making a route map. This allows us to set the memory and computing time limitations in advance. Palm-size PCs generally have insufficient memory to store entire maps on a practical scale and consequently must resort to downloading at the limited speeds typical of cellular phone communication. Thus, if we set a memory limitation, it can generate a map within the limited memory size; if we set a time-limit, it can achieve not only real-time route finding but also real-time map drawing. We implemented a palm-top navigation system that displays the current position on a map produced by the Global Positioning System (GPS) on a palm-size PC. Our experiment demonstrates that a route map generated by our RCS is sufficient for us to reach a goal along a designated route.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Thomas Dean and Mark Boddy, “An Analysis of Time-Dependent Planning,” In Proc. of the Seventh National Conference on Artificial Intelligence, pp. 49–54, 1988.

    Google Scholar 

  2. Hironori Hiraishi, Hayato Ohwada, Fumio Mizoguchi, “Time-Constrained Heuristic Search for Practical Route Finding,” Lecture Notes in Artificial Intelligence 1531, pp. 389–398, 1998.

    Google Scholar 

  3. Hironori Hiraishi, Hayato Ohwada, Fumio Mizoguchi, “Intercommunicating Car Navigation System with Dynamic Route Finding,” In Proc. of the IEEE/IEEJ/JSAI International Conference on Intelligent Transportation Systems (ITSC’99), pp. 248–289, 1999.

    Google Scholar 

  4. Richard E. Korf, “Real-Time Heuristic Search,” Artificial Intelligence 42, pp. 189–211, 1990.

    Article  MATH  Google Scholar 

  5. Pohl, I., “The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving,” In Proc. of the Third International Joint Conference on Artificial Intelligence, pp. 20–23, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hiraishi, H., Mizoguchi, F. (2001). Map Drawing Based on a Resource-Constrained Search for a Navigation System. In: Nareyek, A. (eds) Local Search for Planning and Scheduling. LSPS 2000. Lecture Notes in Computer Science(), vol 2148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45612-0_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45612-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42898-5

  • Online ISBN: 978-3-540-45612-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics