توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱Particle Swarm Optimization with Voronoi Neighborhood
اطلاعات انتشار: چهاردهمین کنفرانس بین المللی سالانه انجمن کامپیوتر ایران، سال
تعداد صفحات: ۶
Particle Swarm Optimization (PSO) is an optimization method that is inspired by nature and is used frequently nowadays. In this paper we proposed a new dynamic geometric neighborhood based on Voronoi diagram in PSO. Voronoi diagram is a geometric naturalistic method to determine neighbors in a set of particles. It seems that in realistic swarm, particles take Voronoi neighbors into account. Also a comparison is made between the performance of some traditional methods for choosing neighbors and new dynamic geometric methods like Voronoi and dynamic Euclidean. In this comparison it is found that PSO with geometric neighborhood can achieve better accuracy overall especially when the optimum value is out of the initial range.<\div>

۲Guarding a Terrain by a Single k–modem Watchtower
اطلاعات انتشار: اولین کنفرانس ملی دانش پژوهان کامپیوتر و فناوری اطلاعات، سال
تعداد صفحات: ۶
In this paper we study the problem of guarding a 2–dimentional terrain by the shortest k–modem watchtower, for a given constant k. We refer to a 2–dimentional terrain as an x–monotone polygonal chain. A kmodem watchtower is a vertical segment whose lower endpoint lies on the terrain and the upper endpoint is k–visible to all points of the terrain. Two points are k–visible if and only if the segment connecting them crosses at most k edges. The watchtower problem has two versions according to whether the lower endpoint of the watchtower lies exactly on a vertex (discrete watchtower problem) or not (continuous watchtower problem). We present the very first algorithm to solve the shortest k–modem watchtower problem in both discrete and continuous versions. Our algorithm runs in O(n4 log n) time for the discrete version and O(n5 log n) time for the continuous version, where n is the number of vertices of the terrain. Given a simple polygon with n vertices and a k–modem placed inside this polygon, we also improve the time complexity of computing all regions that are k–visible to the k–modem to O(n log<\div>

۳visibility based pursuit – evasion problem with teleport points
اطلاعات انتشار: اولین کنفرانس ملی دانش پژوهان کامپیوتر و فناوری اطلاعات، سال
تعداد صفحات: ۵
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<\div>

۴Near Pole Polar Diagram of Points and its Duality With Applications
نویسنده(ها): ،
اطلاعات انتشار: اميركبير، سال
تعداد صفحات: ۶

۵Improved artificial potential field based ant colony optimization for path planning
نویسنده(ها): ،
اطلاعات انتشار: کنفرانس بین المللی پژوهش های کاربردی در فناوری اطلاعات، کامپیوتر و مخابرات، سال
تعداد صفحات: ۸
Path planning field for mobile robot is an important problem that involves finding free path from initial position to goal position .in this paper we introduce an improved artificial potential field based on ant colony optimization .which can obtain additional attractive force to prevent artificial potential field from local minimum .and use ant colony optimization to determine the location of goal in the environment .we develop ant colony optimization to optimize planned path .we do not use the pheromone in all the path from initial position to goal position. We use pheromone in the goal position only. After that the proposed algorithm applied in a laptop computing equipped with 1.80GHz Intel core CPU, 2.5GB memory with 2014 MATLAB in Windows 8.1 Operating System. The simulation results confirm that the proposed algorithm could always find shortest path in less time. the comparison between ant colony optimization and genetic algorithm was also made in this paper.<\div>

۶Sampling–based motion planning algorithms with the aim to improve the preprocessing Speed of the RRT* algorithm
نویسنده(ها): ،
اطلاعات انتشار: دومین کنفرانس بین المللی و سومین همایش ملی کاربرد فناوری های نوین در علوم مهندسی، سال
تعداد صفحات: ۶
In this paper, have been proposed an algorithm based on sampling in order to motion planning multi–robot systems with IPSRRT* name that the aim of it is the RRT* algorithm preprocessing accelerating. The used Strategies in the in IPSRRT* algorithm: 1. the forming and development of two independent random trees of two end point and start point. 2. The sampling based success rate of start and end point. 3. the sampling of middle zone of two start and target zone according to success probability predicting in the future steps and weights assigning to environment different areas for increasing and decreasing of randomly point probability of each zone (all environment points with different probability percent have chance to participate in a random sample choice.)Finally, the proposed algorithm tested in Webots simulator and it’s results compared with TGRRT* ،RRT and RRT* algorithms. The tests results showed that proposed algorithm not only increases the preprocessing speed but also provide shorter route than providing other algorithms.<\div>
نمایش نتایج ۱ تا ۶ از میان ۶ نتیجه