Abstract
A method for path finding of the home robot is presented in this paper. This method is based on Depth First Search (DFS) to find the optimal path of the Home Robot Simulation.DFS is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking. Applied to @Home Simulation Competition, this method can achieve good effect. It is proved that the algorithm used in Home Robot Simulation is with high speed and accuracy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ji, P., Shen, H.: The Current Situation and Development Trend of Service Robot. Changzhou University Journal (February 2010)
The Development Trend of Service Robotic Technology. Robot Technique and Application (March 2009)
Xue, Y.: Optimization Theory and Method. Beijing Industrial University Press, Beijing (2004)
Feng, Y., Long, N.: The Design of Home Robot Simulation Based on Weighted Directed Graph. Robot Technology and Application 4, 49–51 (2010)
Ji, J.: Several Ways to Improve Efficiency of Answer Set Programming and Its Application in Service Robots. University of Science and Technology of China (2010)
Liu, P., Feng, G.: The graph depth first search algorithm analysis and its application. Journal of Qinghai Normal University (March 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, L., Chen, W. (2012). Design for Home Robot Simulation Based on DFS. In: Xiao, T., Zhang, L., Fei, M. (eds) AsiaSim 2012. AsiaSim 2012. Communications in Computer and Information Science, vol 325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34387-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-34387-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34386-5
Online ISBN: 978-3-642-34387-2
eBook Packages: Computer ScienceComputer Science (R0)