#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2003

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

State trajectory and preference constraints are the two language features introduced in PDDL3 (Gerevini & Long 2005) for describing benchmarks of the 5 international planning competition. State trajectory constraints provide an important step of the agreed fragment of PDDL towards the description of temporal control knowledge and temporally extended goals… (More)

- Stefan Edelkamp, Shahid Jabbar
- SPIN
- 2006

To analyze larger models for explicit-state model checking, directed model checking applies error-guided search, external model checking uses secondary storage media, and distributed model checking exploits parallel exploration on multiple processors. In this paper we propose an external, distributed and directed on-the-fly model checking algorithm to check… (More)

- Shahid Jabbar, Stefan Edelkamp
- VMCAI
- 2006

In this paper we present Parallel External A*, a parallel variant of external memory directed model checking. As a model scales up, its successors generation becomes complex and, in turn, starts to impact the running time of the model checker. Probings of our external memory model checker IO-HSF-SPIN revealed that in some of the cases about 70% of the whole… (More)

- R. Bruntrup, S. Edelkamp, S. Jabbar, B. Scholz
- Proceedings. 2005 IEEE Intelligent Transportation…
- 2005

This paper provides a generic approach for map generation based on Global Positioning System (GPS) traces especially for unknown terrains. The system uses AI algorithms to infer the road geometry. Given a set of GPS traces, this input is refined by filtering and partitioning algorithms. For constructing the graph, clustering algorithms are applied that… (More)

In this paper we study External A*, a variant of the conventional (internal) A* algorithm that makes use of external memory, e.g., a hard disk. The approach applies to implicit, undirected, unweighted state space problem graphs with consistent estimates. It combines all three aspects of best-first search, frontier search and delayed duplicate detection and… (More)

Heuristic search is used to efficiently solve the single-node shortest path problem in weighted graphs. In practice, however, one is not only interested in finding a short path, but an optimal path, according to a certain cost notion. We propose an algebraic formalism that captures many cost notions, like typical Quality of Service attributes. We thus… (More)

- Stefan Edelkamp, Shahid Jabbar
- Electr. Notes Theor. Comput. Sci.
- 2006

Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems. Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the set of reachable markings. Typical exploration(reachability analysis) approaches are undirected and do not take into… (More)

Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution. State spaces of such systems can be represented by graph transition systems, which are basically transition systems whose states and transitions represent graphs and graph morphisms.… (More)

- Shahid Jabbar, Stefan Edelkamp
- VMCAI
- 2005

Directed model checking has proved itself to be a useful technique in reducing the state space of the problem graph. But still, its potential is limited by the available memory. This problem can be circumvented by the use of secondary storage devices to store the state space. This paper discusses directed best-first search to enhance error detection… (More)

- Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
- IEEE Transactions on Intelligent Transportation…
- 2005

This paper provides a novel approach for optimal route planning by making efficient use of the underlying geometrical structure. It combines classical artificial intelligence exploration with computational geometry. Given a set of global positioning system (GPS) trajectories, the input is refined by geometric filtering and rounding algorithms. For… (More)