Kevin Vicencio

Learn More
Often times in mobile robotics, optimizing a sequence of tasks and the paths between those destinations is an essential factor. In simple cases, this problem can be modeled by the well-researched Traveling Salesman Problem (TSP). In more complex situations however, the TSP is not a suitable model. In redundant robotic systems, a robot can assume infinitely(More)
Often times in multi-target, Unmanned Aerial System (UAS) applications, minimizing energy consumption is a common goal. In simplified cases, this problem can be solved by minimizing the path length between targets using the Traveling Salesman Problem with Neighborhoods (TSPN). However, this method does not take into account the attitude of the UAS. In(More)
  • 1