Research ArticleOpen accessIn the abstractQuadrotor Obstacle Avoidance Based on Integral BacksteppingLianchuan Zhang, Young Baik Kim, Kil To ChongThis paper addressed obstacle avoidance problem of a quadrotor in outdoor environment. Path planning was finished by employing classical Dijkstra algorithm and the controller of the quadrotor adopted integral backstepping method. In order to get a smooth trajectory with time optimal and acceleration constraints properties, quantic polynomials were utilized to generate trajectory file. The scheme is particularly practical and useful … …American Journal of Applied Sciences, Vol. 13, Issue 7 · 27 Jul 2016 · 6,981 accessesView PDFCite
Research ArticleOpen accessIn the abstractTraversal Algorithm for Complete CoverageKavitha Thiayagarajan, Coimbatore Ganeshsankar BalajiThere are many applications which require complete coverage and obstacle avoidance. The classical A* algorithm provides the user a shortest path by avoiding the obstacle. As well, the Dijkstra’s algorithm finds the shortest path between the source and destination. But in many applications we require complete coverage of the proposed area with obstacle avoidance. There are LSP, LSSP, BSA, spiral-STC … …Journal of Computer Science, Vol. 8, Issue 12 · 15 Dec 2012 · 7,120 accessesView PDFCite
Research ArticleOpen accessIn the abstractConstructing Longest Lifetime Route in Mobile Ad-hoc NetworksFredrick Mtenzi, Yingyu WanA mobile ad hoc network (MANET) is an autonomous system consisting of mobile hosts connected by wireless links. Every host can move in any direction at any speed and time. This leads to a dynamic topology as hosts move constantly. MANET broadcast messages to each hosts, the transmission of one host can be heard by all hosts in its communication … …Journal of Computer Science, Vol. 1, Issue 2 · 19 Oct 2005 · 4,936 accessesView PDFCite