Analyzing uninformed search strategy algorithms in state space search

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages97-102
Number of pages6
ISBN (Electronic)9781509004676
DOIs
Publication statusPublished - 22-06-2017
Externally publishedYes
Event2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016 - Jalgaon, India
Duration: 22-12-201624-12-2016

Conference

Conference2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016
CountryIndia
CityJalgaon
Period22-12-1624-12-16

Fingerprint

Artificial intelligence
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

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
Pooja, S. ; Chethan, S. ; Arjun, C. V. / Analyzing uninformed search strategy algorithms in state space search. Proceedings - International Conference on Global Trends in Signal Processing, Information Computing and Communication, ICGTSPICC 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 97-102
@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 = "6",
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",

}

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 proceedingConference 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

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.

ER -

Pooja S, Chethan S, Arjun CV. 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. Institute of Electrical and Electronics Engineers Inc. 2017. p. 97-102. 7955277 https://doi.org/10.1109/ICGTSPICC.2016.7955277