Stefan Edelkamp

Surface Inspection via Hitting Sets and Multi-goal Motion Planning

This paper develops an approach that enables an aerial vehicle to carry out 3D surface inspections. Given a 3D environment with a set of objects that need to be inspected, and an inspection quality (0,<,alpha ,<,1), the objective is to compute a set of waypoints whose joint visibility ratio is at least (alpha ) and a dynamically-feasible and collision-free trajectory that enables the aerial vehicle to reach all the waypoints. The approach seeks to minimize the number of the waypoints and the overall distance traveled by the aerial vehicle.

Deep or Wide? Learning Policy and Value Neural Networks for Combinatorial Games

The success in learning how to play Go at a professional level is based on training a deep neural network on a wider selection of human expert games and raises the question on the availability, the limits, and the possibilities of this technique for other combinatorial games, especially when there is a lack of access to a larger body of additional expert knowledge.

Proceedings First Workshop on GRAPH Inspection and Traversal Engineering

These are the proceedings of the Second Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2013), which took place on March 24, 2013 in Rome, Italy, as a satellite event of the 16th European Joint Conferences on Theory and Practice of Software (ETAPS 2013). nThe topic of the GRAPHITE workshop is graph analysis in all its forms in computer science. Graphs are used to represent data in many application areas, and they are subjected to various computational algorithms in order to acquire the desired information. These graph algorithms tend to have common characteristics, such as duplicate detection to guarantee their termination, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. Novel techniques to further scale graph search algorithms, and new applications of graph search are within the scope of this workshop. nAnother topic of interest of the event is more related to the structural properties of graphs: which kind of graph characteristics are relevant for a particular application area, and how can these be measured? Finally, any novel way of using graphs for a particular application area is on topic. nThe goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others work is increased.