Skip to main content
Springer Nature Link
Log in

Network search with inadmissible heuristics

  • Search
  • Conference paper
  • First Online:
Knowledge Based Computer Systems (KBCS 1989)

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

Included in the following conference series:

  • 1973 Accesses

Abstract

A new arc-marking algorithm, namely MarkC is presented. MarkC uses the run-time heuristic modification scheme (due to Mero), and the node selection criterion of AlgorithmC (due to Bagchi and Mahanti). AlgorithmC, based on the node expansion scheme, has some important properties under general inadmissible heuristics. AlgorithmC always finds a least costly solution path of V (an implicitly defined set of nodes) and makes O(N2) node expansions at the worst. It is shown that MarkC retains all the merits of C, yet it does not iterate more number of times than C. But there are examples where C can make some more iterations than MarkC. Finally, a comparative study is presented by summarizing the results on Algorithms MarkA, C, and MarkC.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bagchi A and Mahanti A. Search Algorithms Under Different Kinds of Heuristics — A Comparative Study, JACM 30(1), pp.1–21, 1983.

    Google Scholar 

  2. Bagchi A and Mahanti A. Three Approaches to Heuristic Search in Networks, JACM 32(1), pp.1–27, 1985.

    Google Scholar 

  3. Mahanti A and Bagchi A. AND/OR Graph Heuristic Search Methods, JACM 32(1), pp.28–51, 1985.

    Google Scholar 

  4. Martelli A and Montanari U. Additive AND/OR Graphs, Proceedings of Third International Joint Conference on Artificial Intelligence, Stanford, California, pp. 1–11,1973.

    Google Scholar 

  5. Martelli A and Montanari U. Optimising Decision Trees Through Heuristically Guided Search, Comm. ACM, Vol.12, pp.1025–1039, 1978.

    Google Scholar 

  6. Mero L. A Heuristic Search Algorithm with Modifiable Estimate, Artificial Intelligence, Vol.23, pp.13–27, 1984.

    Google Scholar 

  7. Nilsson NJ. Principles of Artificial Intelligence, Tiago, Palo Alto, California, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Management Calcutta, Post Box No. 16757, Alipore Post Office, 700 027, Calcutta, India

    A. Mahanti

  2. Regional Computer Centre, Jadavput University Campus, 700 032, Calcutta, India

    K. Ray

Authors
  1. A. Mahanti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Ray
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramani R. Chandrasekar K. S. R. Anjaneyulu

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mahanti, A., Ray, K. (1990). Network search with inadmissible heuristics. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018401

Download citation

  • DOI: https://doi.org/10.1007/BFb0018401

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52850-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics