Future direction

Vishnu Nath, Stephen E Levinson

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

A simple literature review will reveal a plethora of maze solving algorithms. However, merely executing an algorithm in a sequence of steps is not worthy of present day research, simply because there is nothing to differentiate it from the millions of sequential executions taking place in an ordinary CPU. Furthermore, if the system finds itself in an unknown state, most algorithms do not have a fallback mechanism built into the algorithm. Engineers will have to add some sort of safety check just to get the system back to a known condition. There are times when even this is not sufficient since the exact sequence of states and timing is crucial for the successful termination of the algorithm.

Original languageEnglish (US)
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages65-66
Number of pages2
Edition9783319056029
DOIs
StatePublished - Jan 1 2014

Publication series

NameSpringerBriefs in Computer Science
Number9783319056029
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

Fingerprint

Program processors
Engineers

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Nath, V., & Levinson, S. E. (2014). Future direction. In SpringerBriefs in Computer Science (9783319056029 ed., pp. 65-66). (SpringerBriefs in Computer Science; No. 9783319056029). Springer. https://doi.org/10.1007/978-3-319-05603-6_8

Future direction. / Nath, Vishnu; Levinson, Stephen E.

SpringerBriefs in Computer Science. 9783319056029. ed. Springer, 2014. p. 65-66 (SpringerBriefs in Computer Science; No. 9783319056029).

Research output: Chapter in Book/Report/Conference proceedingChapter

Nath, V & Levinson, SE 2014, Future direction. in SpringerBriefs in Computer Science. 9783319056029 edn, SpringerBriefs in Computer Science, no. 9783319056029, Springer, pp. 65-66. https://doi.org/10.1007/978-3-319-05603-6_8
Nath V, Levinson SE. Future direction. In SpringerBriefs in Computer Science. 9783319056029 ed. Springer. 2014. p. 65-66. (SpringerBriefs in Computer Science; 9783319056029). https://doi.org/10.1007/978-3-319-05603-6_8
Nath, Vishnu ; Levinson, Stephen E. / Future direction. SpringerBriefs in Computer Science. 9783319056029. ed. Springer, 2014. pp. 65-66 (SpringerBriefs in Computer Science; 9783319056029).
@inbook{49f120fc12ef435e929d382fc98311d2,
title = "Future direction",
abstract = "A simple literature review will reveal a plethora of maze solving algorithms. However, merely executing an algorithm in a sequence of steps is not worthy of present day research, simply because there is nothing to differentiate it from the millions of sequential executions taking place in an ordinary CPU. Furthermore, if the system finds itself in an unknown state, most algorithms do not have a fallback mechanism built into the algorithm. Engineers will have to add some sort of safety check just to get the system back to a known condition. There are times when even this is not sufficient since the exact sequence of states and timing is crucial for the successful termination of the algorithm.",
author = "Vishnu Nath and Levinson, {Stephen E}",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-05603-6_8",
language = "English (US)",
series = "SpringerBriefs in Computer Science",
publisher = "Springer",
number = "9783319056029",
pages = "65--66",
booktitle = "SpringerBriefs in Computer Science",
edition = "9783319056029",

}

TY - CHAP

T1 - Future direction

AU - Nath, Vishnu

AU - Levinson, Stephen E

PY - 2014/1/1

Y1 - 2014/1/1

N2 - A simple literature review will reveal a plethora of maze solving algorithms. However, merely executing an algorithm in a sequence of steps is not worthy of present day research, simply because there is nothing to differentiate it from the millions of sequential executions taking place in an ordinary CPU. Furthermore, if the system finds itself in an unknown state, most algorithms do not have a fallback mechanism built into the algorithm. Engineers will have to add some sort of safety check just to get the system back to a known condition. There are times when even this is not sufficient since the exact sequence of states and timing is crucial for the successful termination of the algorithm.

AB - A simple literature review will reveal a plethora of maze solving algorithms. However, merely executing an algorithm in a sequence of steps is not worthy of present day research, simply because there is nothing to differentiate it from the millions of sequential executions taking place in an ordinary CPU. Furthermore, if the system finds itself in an unknown state, most algorithms do not have a fallback mechanism built into the algorithm. Engineers will have to add some sort of safety check just to get the system back to a known condition. There are times when even this is not sufficient since the exact sequence of states and timing is crucial for the successful termination of the algorithm.

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

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

U2 - 10.1007/978-3-319-05603-6_8

DO - 10.1007/978-3-319-05603-6_8

M3 - Chapter

AN - SCOPUS:85044994664

T3 - SpringerBriefs in Computer Science

SP - 65

EP - 66

BT - SpringerBriefs in Computer Science

PB - Springer

ER -