Analyzing uninformed search strategy algorithms in state space search

S. Pooja; S. Chethan; C. V. Arjun

doi:10.1109/ICGTSPICC.2016.7955277

Analyzing uninformed search strategy algorithms in state space search

S. Pooja, S. Chethan, C. V. Arjun

Department of Information and Communication Technology, Manipal Institute of Technology, Manipal

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

Search plays a vital role in tackling many problems in artificial intelligence. Search can be considered as a universal problem solving mechanism in Artificial Intelligence world. Search is most essential as no models in the world are complete, computable and consistent. Solutions to the problem cannot be precomputed and many problems have to be tackled dynamically by considering the observed data. Search framework in Artificial Intelligence can be categorized into state space search, problem reduction search and game tree search. This paper concentrates on one of the aspect of state space search i.e., uninformed search. Uninformed search will be deprived of domain specific information. Search algorithm has to run without any additional knowledge. Different algorithms of uninformed search will be analyzed against time, memory, completeness and optimality. These algorithms are put up in the tabular form, compared and contrasted along with merits and demerits which will enable to pick an appropriate algorithm for a unique problem definition with the memory and time constraints.

Original language	English
Title of host publication	Proceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	97-102
Number of pages	6
ISBN (Electronic)	9781509004676
DOIs	https://doi.org/10.1109/ICGTSPICC.2016.7955277
Publication status	Published - 22-06-2017
Event	2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016 - Jalgaon, India Duration: 22-12-2016 → 24-12-2016

Conference

Conference	2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016
Country/Territory	India
City	Jalgaon
Period	22-12-16 → 24-12-16

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Information Systems
Signal Processing

Access to Document

10.1109/ICGTSPICC.2016.7955277

Cite this

Pooja, S., Chethan, S., & Arjun, C. V. (2017). Analyzing uninformed search strategy algorithms in state space search. In Proceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016 (pp. 97-102). [7955277] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICGTSPICC.2016.7955277

@inproceedings{e8f9e1da9dc64c01a3f2793044ef00e2,

title = "Analyzing uninformed search strategy algorithms in state space search",

abstract = "Search plays a vital role in tackling many problems in artificial intelligence. Search can be considered as a universal problem solving mechanism in Artificial Intelligence world. Search is most essential as no models in the world are complete, computable and consistent. Solutions to the problem cannot be precomputed and many problems have to be tackled dynamically by considering the observed data. Search framework in Artificial Intelligence can be categorized into state space search, problem reduction search and game tree search. This paper concentrates on one of the aspect of state space search i.e., uninformed search. Uninformed search will be deprived of domain specific information. Search algorithm has to run without any additional knowledge. Different algorithms of uninformed search will be analyzed against time, memory, completeness and optimality. These algorithms are put up in the tabular form, compared and contrasted along with merits and demerits which will enable to pick an appropriate algorithm for a unique problem definition with the memory and time constraints.",

author = "S. Pooja and S. Chethan and Arjun, {C. V.}",

year = "2017",

month = jun,

day = "22",

doi = "10.1109/ICGTSPICC.2016.7955277",

language = "English",

pages = "97--102",

booktitle = "Proceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016 ; Conference date: 22-12-2016 Through 24-12-2016",

}

Pooja, S , Chethan, S & Arjun, CV 2017, Analyzing uninformed search strategy algorithms in state space search. in Proceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016., 7955277, Institute of Electrical and Electronics Engineers Inc., pp. 97-102, 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016, Jalgaon, India, 22-12-16. https://doi.org/10.1109/ICGTSPICC.2016.7955277

Analyzing uninformed search strategy algorithms in state space search. / Pooja, S.; Chethan, S.; Arjun, C. V.

Proceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 97-102 7955277.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Analyzing uninformed search strategy algorithms in state space search

AU - Pooja, S.

AU - Chethan, S.

AU - Arjun, C. V.

PY - 2017/6/22

Y1 - 2017/6/22

N2 - Search plays a vital role in tackling many problems in artificial intelligence. Search can be considered as a universal problem solving mechanism in Artificial Intelligence world. Search is most essential as no models in the world are complete, computable and consistent. Solutions to the problem cannot be precomputed and many problems have to be tackled dynamically by considering the observed data. Search framework in Artificial Intelligence can be categorized into state space search, problem reduction search and game tree search. This paper concentrates on one of the aspect of state space search i.e., uninformed search. Uninformed search will be deprived of domain specific information. Search algorithm has to run without any additional knowledge. Different algorithms of uninformed search will be analyzed against time, memory, completeness and optimality. These algorithms are put up in the tabular form, compared and contrasted along with merits and demerits which will enable to pick an appropriate algorithm for a unique problem definition with the memory and time constraints.

AB - Search plays a vital role in tackling many problems in artificial intelligence. Search can be considered as a universal problem solving mechanism in Artificial Intelligence world. Search is most essential as no models in the world are complete, computable and consistent. Solutions to the problem cannot be precomputed and many problems have to be tackled dynamically by considering the observed data. Search framework in Artificial Intelligence can be categorized into state space search, problem reduction search and game tree search. This paper concentrates on one of the aspect of state space search i.e., uninformed search. Uninformed search will be deprived of domain specific information. Search algorithm has to run without any additional knowledge. Different algorithms of uninformed search will be analyzed against time, memory, completeness and optimality. These algorithms are put up in the tabular form, compared and contrasted along with merits and demerits which will enable to pick an appropriate algorithm for a unique problem definition with the memory and time constraints.

UR - http://www.scopus.com/inward/record.url?scp=85025135472&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85025135472&partnerID=8YFLogxK

U2 - 10.1109/ICGTSPICC.2016.7955277

DO - 10.1109/ICGTSPICC.2016.7955277

M3 - Conference contribution

AN - SCOPUS:85025135472

SP - 97

EP - 102

BT - Proceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016

Y2 - 22 December 2016 through 24 December 2016

ER -

Analyzing uninformed search strategy algorithms in state space search

Abstract

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this