سال انتشار: ۱۳۹۰

محل انتشار: اولین کنفرانس ملی دانش پژوهان کامپیوتر و فناوری اطلاعات

تعداد صفحات: ۵

نویسنده(ها):

mansoor davoodi – laboratoty of algorithms and computational geometrym; amirkabir university of technology
bahram kouhestani – laboratoty of algorithms and computational geometrym; amirkabir university of technology
fatemeh saberifar – laboratoty of algorithms and computational geometrym; amirkabir university of technology
ali mohades – laboratoty of algorithms and computational geometrym; amirkabir university of technology

چکیده:

pursuit-evasion problem is a visually searching a polygonal region to find an unpredictable mobail target wich is called evader. The goal is planning a motion stategy for a sercher wich guarantees the evader will be seen eventuaaly. The evader moves arbitrarily fast and continuously movement. taking into account the teleport points the evader can jump among them without time consumption. in this paper we consider pursuit-evasion problem with teleports for three kinds of searchers :oo-searcher;1-searcher and 2-searcher . for both oo-searcher and 1- searcher the problem is solved while the teleports lie inside the polygon; where in case of 2-searcher only the boundary teleports are considered. further we discuss that arise in the existence of teleports in pursuit-evasion problem