Stefan Edelkamp

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 58

Top Venues

CoRR

SOCS

ICAART (1)

University of Freiburg, Freiburg im Breisgau, Germany (PHD)

Education History

University of Freiburg, Freiburg im Breisgau, Germany

PHD

Publications

Samuel Bounan, Stefan Edelkamp
Trick Costs for α μ and New Relatives. ISAIM (2024)
Xuzhe Dang, Stefan Edelkamp, Nicolas Ribault
CLIP-Motion: Learning Reward Functions for Robotic Actions Using Consecutive Observations. CoRR (2023)
Leah Chrestien, Stefan Edelkamp, Antonín Komenda, Tomás Pevný
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal. NeurIPS (2023)
Leah Chrestien, Tomás Pevný, Stefan Edelkamp, Antonín Komenda
Heuristic Search Optimisation Using Planning and Curriculum Learning Techniques. EPIA (1) (2023)
Lorenz Hüther, Karsten Sohr, Bernhard J. Berger, Hendrik Rothe, Stefan Edelkamp
Machine Learning for SAST: A Lightweight and Adaptable Approach. ESORICS (4) (2023)
Yazz Warsame, Stefan Edelkamp
Electric Vehicle Location-Routing Task-Motion Planning. CASE (2023)
Yazz Warsame, Stefan Edelkamp
Capacitated Multi-Robot Task Allocation with Time Windows Using Location-Routing Task-Motion Planning. ICAR (2023)
Leah Chrestien, Tomás Pevný, Stefan Edelkamp, Antonín Komenda
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal. CoRR (2023)
Lukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp
Effective Planning in Resource-Competition Problems by Task Decomposition. SOCS (2022)
Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Stefan Edelkamp
Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation. AAAI (2022)
Xuzhe Dang, Lukás Chrpa, Stefan Edelkamp
Deep RRT. SOCS (2022)
Stefan Edelkamp
Improving Computer Play in Skat with Hope Cards. CG (2022)
Rostislav Horcík, Álvaro Torralba, Pavel Rytír, Lukás Chrpa, Stefan Edelkamp
Optimal Mixed Strategies for Cost-Adversarial Planning Games. ICAPS (2022)
Leah Chrestien, Tomás Pevný, Antonín Komenda, Stefan Edelkamp
A Differentiable Loss Function for Learning Heuristics in A. CoRR (2022)
Stefan Edelkamp
On the Power of Refined Skat Selection. CoRR (2021)
Stefan Edelkamp
Knowledge-Based Paranoia Search. CoG (2021)
Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp
Adversary Strategy Sampling for Effective Plan Generation. SOCS (2021)
Stefan Edelkamp
ELO System for Skat and Other Games of Chance. CoRR (2021)
Leah Chrestien, Tomás Pevný, Antonín Komenda, Stefan Edelkamp
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning. CoRR (2021)
Stefan Edelkamp
Knowledge-Based Paranoia Search in Trick-Taking. CoRR (2021)
Yazz Warsame, Stefan Edelkamp, Erion Plaku
Energy-Aware Multi-Goal Motion Planning Guided by Monte Carlo Search. CASE (2020)
Stefan Edelkamp
Representing and Reducing Uncertainty for Enumerating the Belief Space to Improve Endgame Play in Skat. ECAI (2020)
Stefan Edelkamp
Dynamic Play via Suit Factorization Search in Skat. KI (2020)
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica 82 (3) (2020)
Stefan Edelkamp
Algorithm Engineering for Sorting and Searching, and All That (Invited Talk). SEA (2020)
Ionut Moraru, Stefan Edelkamp, Santiago Franco, Moisés Martínez
Simplifying Automated Pattern Selection for Planning with Symbolic Pattern Databases. KI (2019)
Stefan Edelkamp
Challenging Human Supremacy in Skat. SOCS (2019)
Stefan Edelkamp, Armin Weiß
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ACM J. Exp. Algorithmics 24 (1) (2019)
Stefan Edelkamp, Junho Lee
Multi-robot Multi-goal Motion Planning with Time and Resources. TAROS (1) (2019)
Stefan Edelkamp, Erion Plaku, Yassin Warsame
Monte-Carlo Search for Prize-Collecting Robot Motion Planning with Time Windows, Capacities, Pickups, and Deliveries. KI (2019)
Stefan Edelkamp, Zhuowei Yu
Watchman Routes for Robot Inspection. TAROS (2) (2019)
Stefan Edelkamp, Armin Weiß
Worst-Case Efficient Sorting with QuickMergesort. ALENEX (2019)
Stefan Edelkamp, Armin Weiß
Worst-Case Efficient Sorting with QuickMergesort. CoRR (2018)
Stefan Edelkamp, Morteza Lahijanian, Daniele Magazzeni, Erion Plaku
Integrating Temporal Reasoning and Sampling-Based Motion Planning for Multigoal Problems With Dynamics and Time Windows. IEEE Robotics Autom. Lett. 3 (4) (2018)
Stefan Edelkamp, Armin Weiß
QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting. CoRR (2018)
Erion Plaku, Sara Rashidian, Stefan Edelkamp
Multi-group motion planning in virtual environments. Comput. Animat. Virtual Worlds 29 (6) (2018)
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR (2018)
Stefan Edelkamp, Christoph Greulich
A case study of planning for smart factories - Model checking and Monte Carlo search for the rescue. Int. J. Softw. Tools Technol. Transf. 20 (5) (2018)
Stefan Edelkamp, Christoph Greulich
Nested Rollout Policy Adaptation for Multiagent System Optimization in Manufacturing. ICAART (1) (2017)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Heap Construction - 50 Years Later. Comput. J. 60 (5) (2017)
Álvaro Torralba, Vidal Alcázar, Peter Kissmann, Stefan Edelkamp
Efficient symbolic search for cost-optimal planning. Artif. Intell. 242 (2017)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Optimizing Binary Heaps. Theory Comput. Syst. 61 (2) (2017)
Stefan Edelkamp
Improving the Cache-Efficiency of Shortest Path Search. KI (2017)
Stefan Edelkamp, Baris Can Secim, Erion Plaku
Surface Inspection via Hitting Sets and Multi-goal Motion Planning. TAROS (2017)
Stefan Edelkamp, Mihai Pomarlan, Erion Plaku
Multiregion Inspection by Combining Clustered Traveling Salesman Tours With Sampling-Based Motion Planning. IEEE Robotics Autom. Lett. 2 (2) (2017)
Stefan Edelkamp, Eike Externest, Sebastian Kühl, Sabine Kuske
Solving Graph Optimization Problems in a Framework for Monte-Carlo Search. SOCS (2017)
Ashraf Abdo, Stefan Edelkamp, Michael Lawo
Nested Rollout Policy Adaptation for Optimizing Vehicle Selection in Complex VRPs. LCN Workshops (2016)
Stefan Edelkamp, Tristan Cazenave
Improved Diversity in Nested Rollout Policy Adaptation. KI (2016)
Stefan Edelkamp
Deep or Wide? Learning Policy and Value Neural Networks for Combinatorial Games. CGW@IJCAI (2016)
Stefan Edelkamp, Armin Weiß
BlockQuicksort: How Branch Mispredictions don't affect Quicksort. CoRR (2016)
Stefan Edelkamp, Armin Weiß
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ESA (2016)
Rajeshwari Chatterjee, Christoph Greulich, Stefan Edelkamp
Optimizing Last Mile Delivery Using Public Transport with Multi-Agent Based Control. LCN Workshops (2016)
Dragan Bosnacki, Stefan Edelkamp, Alberto Lluch-Lafuente, Anton Wijs
Special section on Graph Inspection and Traversal Engineering (GRAPHITE 2014). Sci. Comput. Program. 130 (2016)
Christoph Greulich, Stefan Edelkamp
Two Model Checking Approaches to Branch-and-Bound Optimization of a Flow Production System. ICAART (Revised Selected Papers) (2016)
Stefan Edelkamp, Christoph Greulich
Using SPIN for the Optimized Scheduling of Discrete Event Systems in Manufacturing. SPIN (2016)
Stefan Edelkamp, Christoph Greulich
Branch-and-Bound Optimization of a Multiagent System for Flow Production using Model Checking. ICAART (1) (2016)
Stefan Edelkamp, Fritz Jacob
Learning Event Time Series for the Automated Quality Control of Videos. KI (2016)
Stefan Edelkamp, Denis Golubev, Christoph Greulich
Solving the Physical Vehicle Routing Problem for Improved Multi-robot Freespace Navigation. KI (2016)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. CSR (2015)
Stefan Edelkamp, Peter Kissmann, Álvaro Torralba
BDDs Strike Back (in AI Planning). AAAI (2015)
Stefan Edelkamp, Paul Wichern
Packing Irregular-Shaped Objects for 3D Printing. KI (2015)
Christoph Greulich, Stefan Edelkamp, Niels Eicke
Cyber-Physical Multiagent-Simulation in Production Logistics. MATES (2015)
Kai-Oliver Detken, Stefan Edelkamp, Carsten Elfers, Malte Humann, Thomas Rix
Intelligent monitoring with background knowledge. IDAACS (2015)
Stefan Edelkamp, Zhihao Tang
Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem. SOCS (2015)
Florian Pantke, Stefan Edelkamp, Otthein Herzog
Planning with Numeric Key Performance Indicators over Dynamic Organizations of Intelligent Agents. MATES (2014)
Alessandro Cimatti, Stefan Edelkamp, Maria Fox, Daniele Magazzeni, Erion Plaku
Automated Planning and Model Checking (Dagstuhl Seminar 14482). Dagstuhl Reports 4 (11) (2014)
Stefan Edelkamp, Peter Kissmann, Martha Rohte
Symbolic and Explicit Search Hybrid through Perfect Hash Functions - A Case Study in Connect Four. ICAPS (2014)
Stefan Edelkamp, Christoph Greulich
Solving Physical Traveling Salesman Problems with policy adaptation. CIG (2014)
Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. CoRR (2014)
Stefan Edelkamp, Armin Weiß
QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. CSR (2014)
Stefan Edelkamp, Max Gath, Moritz Rohde
Monte-Carlo Tree Search for 3D Packing with Object Orientation. KI (2014)
Stefan Edelkamp, Max Gath
Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search. ICAART (1) (2014)
Sara Rashidian, Erion Plaku, Stefan Edelkamp
Motion planning with rigid-body dynamics for generalized traveling salesman tours. MIG (2014)
Stefan Edelkamp, Erion Plaku
Multi-goal motion planning with physics-based game engines. CIG (2014)
Christoph Greulich, Stefan Edelkamp, Max Gath, Tobias Warden, Malte Humann, Otthein Herzog, T. G. Sitharam
Enhanced Shortest Path Computation for Multiagent-based Intermodal Transport Planning in Dynamic Environments. ICAART (2) (2013)
Martin Stommel, Stefan Edelkamp, Thiemo Wiedemeyer, Michael Beetz
Fractal Approximate Nearest Neighbour Search in Log-Log Time. BMVC (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Weak heaps engineered. J. Discrete Algorithms 23 (2013)
Max Gath, Stefan Edelkamp, Otthein Herzog
Agent-Based Dispatching Enables Autonomous Groupage Traffic. J. Artif. Intell. Soft Comput. Res. 3 (1) (2013)
Stefan Edelkamp, Max Gath, Tristan Cazenave, Fabien Teytaud
Algorithm and knowledge engineering for the TSPTW problem. CISched (2013)
Stefan Edelkamp, Armin Weiß
QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average. CoRR (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
Weak Heaps and Friends: Recent Developments. IWOCA (2013)
Stefan Edelkamp, Max Gath
Optimal Decision Making in Agent-based Autonomous Groupage Traffic. ICAART (1) (2013)
Álvaro Torralba, Stefan Edelkamp, Peter Kissmann
Transition Trees for Cost-Optimal Symbolic Planning. ICAPS (2013)
Carsten Elfers, Stefan Edelkamp, Hartmut Messerschmidt
Combining Conditional Random Fields and Background Knowledge for Improved Cyber Security. KI (2013)
Max Gath, Stefan Edelkamp, Otthein Herzog
Agent-based dispatching in groupage traffic. CIPLS (2013)
Christoph Greulich, Stefan Edelkamp, Max Gath
Agent-Based Multimodal Transport Planning in Dynamic Environments. KI (2013)
Stefan Edelkamp, Peter Kissmann, Álvaro Torralba
Lex-Partitioning: A New Option for BDD Search GRAPHITE (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
A Catalogue of Algorithms for Building Weak Heaps. IWOCA (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16 (2012)
Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS (2012)
Stefan Edelkamp, Martin Stommel
The Bitvector Machine: A Fast and Robust Machine Learning Algorithm for Non-linear Problems. ECML/PKDD (1) (2012)
Carsten Elfers, Stefan Edelkamp, Otthein Herzog
Efficient Tolerant Pattern Matching with Constraint Abstractions in Description Logic. ICAART (1) (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS (2012)
David Zastrau, Stefan Edelkamp
Stochastic Gradient Descent with GPGPU. KI (2012)
Stefan Edelkamp, Peter Kissmann, Álvaro Torralba
Search with Pattern Databases and the Merge-and-Shrink Abstraction. ECAI (2012)
Stefan Edelkamp, Tim Federholzner, Peter Kissmann
Searching with Partial Belief States in General Games with Incomplete Information. KI (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA (2011)
Peter Kissmann, Stefan Edelkamp
Improving Cost-Optimal Domain-Independent Symbolic Planning. AAAI (2011)
Stefan Edelkamp, Peter Kissmann
On the Complexity of BDDs for State Space Search: A Case Study in Connect Four. AAAI (2011)
Stefan Edelkamp, Roman Englert, Jörg Hoffmann, Frederico dos S. Liporace, Sylvie Thiébaux, Sebastian Trüg
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4 CoRR (2011)

Stefan Edelkamp.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stefan Edelkamp