کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
431003 688249 2012 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Dynamic graph-based search in unknown environments
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Dynamic graph-based search in unknown environments
چکیده انگلیسی

A novel graph-based approach to search in unknown environments is presented. A virtual geometric structure is imposed on the environment represented in computer memory by a graph. Algorithms use this representation to coordinate a team of robots (or entities). Local discovery of environmental features cause dynamic expansion of the graph resulting in global exploration of the unknown environment. The algorithm is shown to have O(k⋅nH)O(k⋅nH) time complexity, where nHnH is the number of vertices of the discovered environment and 1⩽k

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Discrete Algorithms - Volume 12, April 2012, Pages 2–13
نویسندگان
, , ,