Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Computer Engineering

Abstraction Hierarchies For Multi-Agent Pathfinding, Aaron R. Kraft Jan 2017

Abstraction Hierarchies For Multi-Agent Pathfinding, Aaron R. Kraft

Electronic Theses and Dissertations

Multi-Agent Pathfinding is an NP-Complete search problem with a branching factor that is exponential in the number of agents. Because of this exponential feature, it can be difficult to solve optimally using traditional search techniques, even for relatively small problems. Many recent optimal solvers have attempted to reduce the complexity of the problem by resolving the conflicts between agent paths separately. Very little of this research has focused on creating quality heuristics to help solve the problem. In this thesis, we create heuristics using sub-problems created by removing agents from a complete problem instance. We combine this with the Independence …


Explaining The Performance Of Bidirectional Dijkstra And A* On Road Networks, Sneha Sawlani Jan 2017

Explaining The Performance Of Bidirectional Dijkstra And A* On Road Networks, Sneha Sawlani

Electronic Theses and Dissertations

The heuristic search community traditionally uses A* as the baseline algorithm for their research methods. Research papers in the road networks community, however, often build upon Dijkstra's algorithm and use Bidirectional Dijkstra's algorithm as their baseline. This thesis investigates the performance of A* and Bidirectional Dijkstra in road networks to see how they compare and to see if there is a principled explanation for the different approaches. Our analysis reveals why Bidirectional Dijkstra can perform well in this domain, but also shows a simple mistake that can be made when building test problems that hurts the performance of A*.


Optimized Trajectory Generation For Car-Like Robots On A Closed Loop Track, Tyler Friedl Jan 2017

Optimized Trajectory Generation For Car-Like Robots On A Closed Loop Track, Tyler Friedl

Electronic Theses and Dissertations

This thesis presents a method for generating an optimized path through a given track. The path is generated by choosing waypoints throughout the track then iteratively optimizing the position of these waypoints. The waypoints are then connected by optimized paths represented by curvature polynomials. The end result is a path through the track represented as a spline of curvature polynomials. This method is applied to multiple simulated tracks and the results are presented. By generating and representing the paths in the continuous domain, the method has improved computational efficiency from many of the discrete methods used to generate an optimal …


System Identification Of A Circulation Control Unmanned Aerial Vehicle, Mohammed Agha Jan 2017

System Identification Of A Circulation Control Unmanned Aerial Vehicle, Mohammed Agha

Electronic Theses and Dissertations

The advancement in automation and sensory systems in recent years has led to an increase the demand of UAV missions. Due to this increase in demand, the research community has gained interest in investigating UAV performance enhancing systems. Circulation Control (CC), which is an active control flow method used to enhance UAV lift, is a performance enhancing system currently studied. In prior research, experimental studies have shown that Circulation Control wings (CCW) implemented on class-I UAVs can reduce take-off distance by 54%. Wind tunnel tests reveal that CC improves aircraft payload capabilities through lift enhancement. Increasing aircraft payload capabilities causes …