default search action
Stefan Edelkamp
Person information
- affiliation: King's College London, UK
- affiliation (former): University of Bremen, TZI, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c150]Samuel Bounan, Stefan Edelkamp:
Trick Costs for α μ and New Relatives. ISAIM 2024: 50-67 - [c149]Xuzhe Dang, Stefan Edelkamp:
Data Augmentation in Latent Space with Variational Autoencoder and Pretrained Image Model for Visual Reinforcement Learning. KI 2024: 45-59 - [c148]Stefan Edelkamp:
Could the Declarer Have Discarded It? Refined Anticipation of Cards in Skat. KI 2024: 60-72 - [c147]Stefan Edelkamp:
A Framework for General Trick-Taking Card Games. KI 2024: 73-85 - 2023
- [b3]Stefan Edelkamp:
Algorithmic Intelligence - Towards an Algorithmic Foundation for Artificial Intelligence. Springer 2023, ISBN 978-3-319-65595-6, pp. 3-437 - [c146]Yazz Warsame, Stefan Edelkamp:
Electric Vehicle Location-Routing Task-Motion Planning. CASE 2023: 1-7 - [c145]Leah Chrestien, Tomás Pevný, Stefan Edelkamp, Antonín Komenda:
Heuristic Search Optimisation Using Planning and Curriculum Learning Techniques. EPIA (1) 2023: 495-507 - [c144]Lorenz Hüther, Karsten Sohr, Bernhard J. Berger, Hendrik Rothe, Stefan Edelkamp:
Machine Learning for SAST: A Lightweight and Adaptable Approach. ESORICS (4) 2023: 85-104 - [c143]Yazz Warsame, Stefan Edelkamp:
Capacitated Multi-Robot Task Allocation with Time Windows Using Location-Routing Task-Motion Planning. ICAR 2023: 42-48 - [c142]Leah Chrestien, Stefan Edelkamp, Antonín Komenda, Tomás Pevný:
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal. NeurIPS 2023 - [i21]Leah Chrestien, Tomás Pevný, Stefan Edelkamp, Antonín Komenda:
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal. CoRR abs/2310.19463 (2023) - [i20]Xuzhe Dang, Stefan Edelkamp, Nicolas Ribault:
CLIP-Motion: Learning Reward Functions for Robotic Actions Using Consecutive Observations. CoRR abs/2311.03485 (2023) - 2022
- [c141]Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Stefan Edelkamp:
Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation. AAAI 2022: 9707-9715 - [c140]Rostislav Horcík, Álvaro Torralba, Pavel Rytír, Lukás Chrpa, Stefan Edelkamp:
Optimal Mixed Strategies for Cost-Adversarial Planning Games. ICAPS 2022: 160-168 - [c139]Stefan Edelkamp:
Improving Computer Play in Skat with Hope Cards. CG 2022: 133-145 - [c138]Lukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp:
Effective Planning in Resource-Competition Problems by Task Decomposition. SOCS 2022: 47-55 - [c137]Xuzhe Dang, Lukás Chrpa, Stefan Edelkamp:
Deep RRT. SOCS 2022: 333-335 - [i19]Leah Chrestien, Tomás Pevný, Antonín Komenda, Stefan Edelkamp:
A Differentiable Loss Function for Learning Heuristics in A. CoRR abs/2209.05206 (2022) - 2021
- [c136]Stefan Edelkamp:
Knowledge-Based Paranoia Search. CoG 2021: 1-8 - [c135]Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp:
Adversary Strategy Sampling for Effective Plan Generation. SOCS 2021: 164-166 - [e14]Stefan Edelkamp, Ralf Möller, Elmar Rueckert:
KI 2021: Advances in Artificial Intelligence - 44th German Conference on AI, Virtual Event, September 27 - October 1, 2021, Proceedings. Lecture Notes in Computer Science 12873, Springer 2021, ISBN 978-3-030-87625-8 [contents] - [i18]Stefan Edelkamp:
On the Power of Refined Skat Selection. CoRR abs/2104.02997 (2021) - [i17]Stefan Edelkamp:
ELO System for Skat and Other Games of Chance. CoRR abs/2104.05422 (2021) - [i16]Stefan Edelkamp:
Knowledge-Based Paranoia Search in Trick-Taking. CoRR abs/2104.05423 (2021) - [i15]Leah Chrestien, Tomás Pevný, Antonín Komenda, Stefan Edelkamp:
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning. CoRR abs/2112.01918 (2021) - 2020
- [j32]Stefan Edelkamp, Armin Weiß, Sebastian Wild:
QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica 82(3): 509-588 (2020) - [c134]Yazz Warsame, Stefan Edelkamp, Erion Plaku:
Energy-Aware Multi-Goal Motion Planning Guided by Monte Carlo Search. CASE 2020: 335-342 - [c133]Stefan Edelkamp:
Representing and Reducing Uncertainty for Enumerating the Belief Space to Improve Endgame Play in Skat. ECAI 2020: 395-402 - [c132]Stefan Edelkamp:
Dynamic Play via Suit Factorization Search in Skat. KI 2020: 18-32 - [c131]Stefan Edelkamp:
Algorithm Engineering for Sorting and Searching, and All That (Invited Talk). SEA 2020: 2:1-2:3
2010 – 2019
- 2019
- [j31]Stefan Edelkamp, Armin Weiß:
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ACM J. Exp. Algorithmics 24(1): 1.4:1-1.4:22 (2019) - [c130]Stefan Edelkamp, Armin Weiß:
Worst-Case Efficient Sorting with QuickMergesort. ALENEX 2019: 1-14 - [c129]Stefan Edelkamp, Erion Plaku, Yassin Warsame:
Monte-Carlo Search for Prize-Collecting Robot Motion Planning with Time Windows, Capacities, Pickups, and Deliveries. KI 2019: 154-167 - [c128]Ionut Moraru, Stefan Edelkamp, Santiago Franco, Moisés Martínez:
Simplifying Automated Pattern Selection for Planning with Symbolic Pattern Databases. KI 2019: 249-263 - [c127]Stefan Edelkamp:
Challenging Human Supremacy in Skat. SOCS 2019: 52-60 - [c126]Stefan Edelkamp, Zhuowei Yu:
Watchman Routes for Robot Inspection. TAROS (2) 2019: 179-190 - [c125]Stefan Edelkamp, Junho Lee:
Multi-robot Multi-goal Motion Planning with Time and Resources. TAROS (1) 2019: 288-299 - 2018
- [j30]Erion Plaku, Sara Rashidian, Stefan Edelkamp:
Multi-group motion planning in virtual environments. Comput. Animat. Virtual Worlds 29(6) (2018) - [j29]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): 3473-3480 (2018) - [j28]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): 515-528 (2018) - [i14]Stefan Edelkamp, Armin Weiß:
QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting. CoRR abs/1804.10062 (2018) - [i13]Stefan Edelkamp, Armin Weiß:
Worst-Case Efficient Sorting with QuickMergesort. CoRR abs/1811.00833 (2018) - [i12]Stefan Edelkamp, Armin Weiß, Sebastian Wild:
QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR abs/1811.01259 (2018) - 2017
- [j27]Álvaro Torralba, Vidal Alcázar, Peter Kissmann, Stefan Edelkamp:
Efficient symbolic search for cost-optimal planning. Artif. Intell. 242: 52-79 (2017) - [j26]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Heap Construction - 50 Years Later. Comput. J. 60(5): 657-674 (2017) - [j25]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Optimizing Binary Heaps. Theory Comput. Syst. 61(2): 606-636 (2017) - [j24]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): 428-435 (2017) - [c124]Stefan Edelkamp, Christoph Greulich:
Nested Rollout Policy Adaptation for Multiagent System Optimization in Manufacturing. ICAART (1) 2017: 284-290 - [c123]Stefan Edelkamp:
Improving the Cache-Efficiency of Shortest Path Search. KI 2017: 99-113 - [c122]Stefan Edelkamp, Eike Externest, Sebastian Kühl, Sabine Kuske:
Solving Graph Optimization Problems in a Framework for Monte-Carlo Search. SOCS 2017: 163-164 - [c121]Stefan Edelkamp, Baris Can Secim, Erion Plaku:
Surface Inspection via Hitting Sets and Multi-goal Motion Planning. TAROS 2017: 134-149 - [e13]Tristan Cazenave, Mark H. M. Winands, Stefan Edelkamp, Stephan Schiffel, Michael Thielscher, Julian Togelius:
Computer Games - 5th Workshop on Computer Games, CGW 2016, and 5th Workshop on General Intelligence in Game-Playing Agents, GIGA 2016, Held in Conjunction with the 25th International Conference on Artificial Intelligence, IJCAI 2016, New York City, NY, USA, July 9-10, 2016, Revised Selected Papers. Communications in Computer and Information Science 705, 2017, ISBN 978-3-319-57968-9 [contents] - 2016
- [j23]Dragan Bosnacki, Stefan Edelkamp, Alberto Lluch-Lafuente, Anton Wijs:
Special section on Graph Inspection and Traversal Engineering (GRAPHITE 2014). Sci. Comput. Program. 130: 1 (2016) - [c120]Stefan Edelkamp, Armin Weiß:
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ESA 2016: 38:1-38:16 - [c119]Christoph Greulich, Stefan Edelkamp:
Two Model Checking Approaches to Branch-and-Bound Optimization of a Flow Production System. ICAART (Revised Selected Papers) 2016: 19-36 - [c118]Stefan Edelkamp, Christoph Greulich:
Branch-and-Bound Optimization of a Multiagent System for Flow Production using Model Checking. ICAART (1) 2016: 27-37 - [c117]Stefan Edelkamp:
Deep or Wide? Learning Policy and Value Neural Networks for Combinatorial Games. CGW@IJCAI 2016: 19-33 - [c116]Stefan Edelkamp, Tristan Cazenave:
Improved Diversity in Nested Rollout Policy Adaptation. KI 2016: 43-55 - [c115]Stefan Edelkamp, Fritz Jacob:
Learning Event Time Series for the Automated Quality Control of Videos. KI 2016: 148-154 - [c114]Stefan Edelkamp, Denis Golubev, Christoph Greulich:
Solving the Physical Vehicle Routing Problem for Improved Multi-robot Freespace Navigation. KI 2016: 155-161 - [c113]Rajeshwari Chatterjee, Christoph Greulich, Stefan Edelkamp:
Optimizing Last Mile Delivery Using Public Transport with Multi-Agent Based Control. LCN Workshops 2016: 205-212 - [c112]Ashraf Abdo, Stefan Edelkamp, Michael Lawo:
Nested Rollout Policy Adaptation for Optimizing Vehicle Selection in Complex VRPs. LCN Workshops 2016: 213-221 - [c111]Stefan Edelkamp, Christoph Greulich:
Using SPIN for the Optimized Scheduling of Discrete Event Systems in Manufacturing. SPIN 2016: 57-77 - [p1]Stefan Edelkamp:
External-Memory State Space Search. Algorithm Engineering 2016: 185-225 - [e12]Amanda Jane Coles, Andrew Coles, Stefan Edelkamp, Daniele Magazzeni, Scott Sanner:
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12-17, 2016. AAAI Press 2016, ISBN 978-1-57735-757-5 [contents] - [e11]Tristan Cazenave, Mark H. M. Winands, Stefan Edelkamp, Stephan Schiffel, Michael Thielscher, Julian Togelius:
Computer Games - Fourth Workshop on Computer Games, CGW 2015, and the Fourth Workshop on General Intelligence in Game-Playing Agents, GIGA 2015, Held in Conjunction with the 24th International Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 26-27, 2015, Revised Selected Papers. Communications in Computer and Information Science 614, Springer 2016, ISBN 978-3-319-39401-5 [contents] - [i11]Stefan Edelkamp, Armin Weiß:
BlockQuicksort: How Branch Mispredictions don't affect Quicksort. CoRR abs/1604.06697 (2016) - 2015
- [c110]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba:
BDDs Strike Back (in AI Planning). AAAI 2015: 4320-4321 - [c109]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: 204-218 - [c108]Kai-Oliver Detken, Stefan Edelkamp, Carsten Elfers, Malte Humann, Thomas Rix:
Intelligent monitoring with background knowledge. IDAACS 2015: 165-170 - [c107]Stefan Edelkamp, Paul Wichern:
Packing Irregular-Shaped Objects for 3D Printing. KI 2015: 45-58 - [c106]Christoph Greulich, Stefan Edelkamp, Niels Eicke:
Cyber-Physical Multiagent-Simulation in Production Logistics. MATES 2015: 119-136 - [c105]Stefan Edelkamp, Zhihao Tang:
Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem. SOCS 2015: 9-17 - 2014
- [c104]Stefan Edelkamp, Peter Kissmann, Martha Rohte:
Symbolic and Explicit Search Hybrid through Perfect Hash Functions - A Case Study in Connect Four. ICAPS 2014 - [c103]Stefan Edelkamp, Christoph Greulich:
Solving Physical Traveling Salesman Problems with policy adaptation. CIG 2014: 1-8 - [c102]Stefan Edelkamp, Erion Plaku:
Multi-goal motion planning with physics-based game engines. CIG 2014: 1-8 - [c101]Stefan Edelkamp, Armin Weiß:
QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. CSR 2014: 139-152 - [c100]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: 22-33 - [c99]Stefan Edelkamp, Max Gath, Moritz Rohde:
Monte-Carlo Tree Search for 3D Packing with Object Orientation. KI 2014: 285-296 - [c98]Florian Pantke, Stefan Edelkamp, Otthein Herzog:
Planning with Numeric Key Performance Indicators over Dynamic Organizations of Intelligent Agents. MATES 2014: 138-155 - [c97]Sara Rashidian, Erion Plaku, Stefan Edelkamp:
Motion planning with rigid-body dynamics for generalized traveling salesman tours. MIG 2014: 87-96 - [e10]Stefan Edelkamp, Roman Barták:
Proceedings of the Seventh Annual Symposium on Combinatorial Search, SOCS 2014, Prague, Czech Republic, 15-17 August 2014. AAAI Press 2014, ISBN 978-1-57735-676-9 [contents] - [e9]Dragan Bosnacki, Stefan Edelkamp, Alberto Lluch-Lafuente, Anton Wijs:
Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, GRAPHITE 2014, Grenoble, France, 5th April 2014. EPTCS 159, 2014 [contents] - [i10]Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry:
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. CoRR abs/1407.3377 (2014) - [i9]Alessandro Cimatti, Stefan Edelkamp, Maria Fox, Daniele Magazzeni, Erion Plaku:
Automated Planning and Model Checking (Dagstuhl Seminar 14482). Dagstuhl Reports 4(11): 227-245 (2014) - 2013
- [j22]Max Gath, Stefan Edelkamp, Otthein Herzog:
Agent-Based Dispatching Enables Autonomous Groupage Traffic. J. Artif. Intell. Soft Comput. Res. 3(1): 27 (2013) - [j21]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Weak heaps engineered. J. Discrete Algorithms 23: 83-97 (2013) - [c96]Álvaro Torralba, Stefan Edelkamp, Peter Kissmann:
Transition Trees for Cost-Optimal Symbolic Planning. ICAPS 2013 - [c95]Martin Stommel, Stefan Edelkamp, Thiemo Wiedemeyer, Michael Beetz:
Fractal Approximate Nearest Neighbour Search in Log-Log Time. BMVC 2013 - [c94]Max Gath, Stefan Edelkamp, Otthein Herzog:
Agent-based dispatching in groupage traffic. CIPLS 2013: 54-60 - [c93]Stefan Edelkamp, Max Gath, Tristan Cazenave, Fabien Teytaud:
Algorithm and knowledge engineering for the TSPTW problem. CISched 2013: 44-51 - [c92]Stefan Edelkamp, Max Gath:
Optimal Decision Making in Agent-based Autonomous Groupage Traffic. ICAART (1) 2013: 248-254 - [c91]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: 324-329 - [c90]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß:
Weak Heaps and Friends: Recent Developments. IWOCA 2013: 1-6 - [c89]Christoph Greulich, Stefan Edelkamp, Max Gath:
Agent-Based Multimodal Transport Planning in Dynamic Environments. KI 2013: 74-85 - [c88]Carsten Elfers, Stefan Edelkamp, Hartmut Messerschmidt:
Combining Conditional Random Fields and Background Knowledge for Improved Cyber Security. KI 2013: 284-287 - [e8]Anton Wijs, Dragan Bosnacki, Stefan Edelkamp:
Proceedings 2nd Workshop on GRAPH Inspection and Traversal Engineering, GRAPHITE 2013, Rome, Italy, March 24, 2013. EPTCS 138, 2013 [contents] - [i8]Stefan Edelkamp, Armin Weiß:
QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average. CoRR abs/1307.3033 (2013) - 2012
- [b2]Stefan Edelkamp, Stefan Schrödl:
Heuristic Search - Theory and Applications. Academic Press 2012, ISBN 978-0-12-372512-7, pp. I_XXIV, 1-836 - [j20]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16: 187-205 (2012) - [c87]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS 2012: 103-112 - [c86]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba:
Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction. ECAI 2012: 306-311 - [c85]Carsten Elfers, Stefan Edelkamp, Otthein Herzog:
Efficient Tolerant Pattern Matching with Constraint Abstractions in Description Logic. ICAART (1) 2012: 256-261 - [c84]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
A Catalogue of Algorithms for Building Weak Heaps. IWOCA 2012: 249-262 - [c83]Stefan Edelkamp, Tim Federholzner, Peter Kissmann:
Searching with Partial Belief States in General Games with Incomplete Information. KI 2012: 25-36 - [c82]David Zastrau, Stefan Edelkamp:
Stochastic Gradient Descent with GPGPU. KI 2012: 193-204 - [c81]Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS 2012: 259-270 - [c80]Stefan Edelkamp, Martin Stommel:
The Bitvector Machine: A Fast and Robust Machine Learning Algorithm for Non-linear Problems. ECML/PKDD (1) 2012: 175-190 - [c79]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba:
Lex-Partitioning: A New Option for BDD Search. GRAPHITE 2012: 66-82 - [e7]Anton Wijs, Dragan Bosnacki, Stefan Edelkamp:
Proceedings First Workshop on GRAPH Inspection and Traversal Engineering, GRAPHITE 2012, Tallinn, Estonia, 1st April 2012. EPTCS 99, 2012 [contents] - 2011
- [j19]Peter Kissmann, Stefan Edelkamp:
Gamer, a General Game Playing Agent. Künstliche Intell. 25(1): 49-52 (2011) - [j18]Stefan Edelkamp, Damian Sulewski, Jiri Barnat, Lubos Brim, Pavel Simecek:
Flash memory efficient LTL model checking. Sci. Comput. Program. 76(2): 136-157 (2011) - [j17]Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski, Anton Wijs:
Parallel probabilistic model checking on general purpose graphics processors. Int. J. Softw. Tools Technol. Transf. 13(1): 21-35 (2011) - [c78]Stefan Edelkamp, Peter Kissmann:
On the Complexity of BDDs for State Space Search: A Case Study in Connect Four. AAAI 2011: 18-23 - [c77]Peter Kissmann, Stefan Edelkamp:
Improving Cost-Optimal Domain-Independent Symbolic Planning. AAAI 2011: 992-997 - [c76]Damian Sulewski, Stefan Edelkamp, Peter Kissmann:
Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU. ICAPS 2011 - [c75]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA 2011: 195-208 - [e6]Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert:
Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI 2011 [contents] - [e5]Joscha Bach, Stefan Edelkamp:
KI 2011: Advances in Artificial Intelligence, 34th Annual German Conference on AI, Berlin, Germany, October 4-7,2011. Proceedings. Lecture Notes in Computer Science 7006, Springer 2011, ISBN 978-3-642-24454-4 [contents] - [i7]Stefan Edelkamp:
Taming Numbers and Durations in the Model Checking Integrated Planning System. CoRR abs/1107.0025 (2011) - [i6]