NDLI: Three approaches to heuristic search in networks

Content Provider	ACM Digital Library
Author	Bagchi, A. Mahanti, A.
Copyright Year	1985
Abstract	Three different approaches to heuristic search in networks are analyzed. In the first approach, as formulated initially by Hart, Nilsson, and Raphael, and later modified by Martelli, the basic idea is to choose for expansion that node for which the evaluation function has a minimum value. A second approach has recently been suggested by Nilsson. In this method, in contrast to the earlier one, a node that is expanded once is not expanded again; instead, a “propagation” of values takes place. The third approach is an adaptation for networks of an AND/OR graph “marking” algorithm, originally due to Martelli and Montanari.Five algorithms are presented. Algorithms A and C illustrate the first approach; PropA and PropC, the second one; and MarkA, the third one. The performances of these algorithms are compared for both admissible and inadmissible heuristics using the following two criteria: (i) cost of the solution found; (ii) time of execution in the worst case, as measured by the number of node expansions (A, C), or node “selections” (PropA, PropC), or arc “markings” (MarkA).The relative merits and demerits of the algorithms are summarized and indications are given regarding which algorithm to use in different situations.
Starting Page	1
Ending Page	27
Page Count	27
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/2455.2458
Journal	Journal of the ACM (JACM)
Volume Number	32
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1985-01-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Bidirectional Heuristic Search Again

AND/OR graph heuristic search methods

An Improved Bidirectional Heuristic Search Algorithm

Experiments with a Heuristic Compiler

Dynamic interpolation search

Search within a Page

Computer Approaches to the Representations of Lie Algebras

Three open problems in AI

Three problems in computer science

Three approaches to heuristic search in networks

Similar Documents

Bidirectional Heuristic Search Again

AND/OR graph heuristic search methods

An Improved Bidirectional Heuristic Search Algorithm

Experiments with a Heuristic Compiler

Dynamic interpolation search

Search within a Page

Computer Approaches to the Representations of Lie Algebras

Three open problems in AI

Three problems in computer science

Three approaches to heuristic search in networks