Author name cluster

Andre Nusser

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers

1 author row

AAAI Conference 2017 Conference Paper

The Simultaneous Maze Solving Problem

Stefan Funke
Andre Nusser
Sabine Storandt

A grid maze is a binary matrix where ﬁelds containing a 0 are accessible while ﬁelds containing a 1 are blocked. A movement sequence consists of relative movements up, down, left, right – moving to a blocked ﬁeld results in non-movement. The simultaneous maze solving problem asks for the shortest movement sequence starting in the upper left corner and visiting the lower right corner for all mazes of size n × m (for which a path from the upper left to the lower right corner exists at all). We present a theoretical problem analysis, including hardness results and a cubic upper bound on the sequence length. In addition, we describe several approaches to practically compute solving sequences and lower bounds despite the high combinatorial complexity of the problem.

PDF Details

JAIR Journal 2015 Journal Article

Placement of Loading Stations for Electric Vehicles: No Detours Necessary!

Stefan Funke
Andre Nusser
Sabine Storandt

Compared to conventional cars, electric vehicles (EVs) still suffer from considerably shorter cruising ranges. Combined with the sparsity of battery loading stations, the complete transition to E-mobility still seems a long way to go. In this paper, we consider the problem of placing as few loading stations as possible so that on any shortest path there are sufficiently many not to run out of energy. We show how to model this problem and introduce heuristics which provide close-to-optimal solutions even in large road networks.

PDF Details DOI

AAAI Conference 2014 Conference Paper

Placement of Loading Stations for Electric Vehicles: No Detours Necessary!

Stefan Funke
Andre Nusser
Sabine Storandt

Compared to conventional cars, electric vehicles still suffer from a considerably shorter cruising range. Combined with the sparsity of battery loading stations, the complete transition to E-mobility still seems a long way to go. In this paper, we consider the problem of placing as few loading stations as possible such that on any shortest path there are enough to guarantee sufficient energy supply. This means, that EV owners no longer have to plan their trips ahead incorporating loading station locations, and are no longer forced to accept long detours to reach their destinations. We show how to model this problem and introduce heuristics which provide close-to-optimal solutions even in large road networks.

PDF Details