Michael Thielscher is a Professor at The University of New South Wales.
Michael received his postgraduate diploma and his Ph.D., both with distinction, as well as his Higher Doctorate (Habilitation) in Computer Science from Darmstadt University. He then joined Dresden University, where he was an associate professor before he moved to his present position. His Habilitation thesis was honoured with the Award for Research Excellence by the alumni of Darmstadt University in 1998, and in 2009 he won a Future Fellowship Award from the Australian Research Council.
Michael has been Program Co-Chair for AI'12 and KI'14, and he will be Program Co-Chair for KR'18.
Michael's current research is mainly in Knowledge Representation, Cognitive Agents and Robots, General Game Playing, and Constraint Logic Programming. He is author of over 150 refereed papers and four books, and he has co-authored the award-winning system FLUXPLAYER, which in 2006 was crowned the World Champion at the AAAI General Game Playing Competition.
Michael was an invited speaker at the AAAI-10 conference. The slides for his talk on systems with general intelligence can be found here, and a video recording can be watched here.
General Problem-Solving Systems
A general problem-solving system can understand descriptions of new problems and solve them without human intervention. An example are general game players, which can play previously unknown games given nothing but their rules. General Problem Solving has been identified as a Grand Challenge of Artificial Intelligence, drawing from a variety of sub-disciplines, including Knowledge Representation, Automated Reasoning, Search, and Learning.
Strategic Reasoning and Planning for General Game-Playing Robots (Australia-Germany Joint Research Cooperation Scheme 2016-2017)
General game-playing programs learn to play new computer games just from the rules. This project aims to take this a step further and develop fundamental strategic reasoning techniques for general game-playing robots. These will enable robots to understand descriptions of new games played in real environments, to gain knowledge of rules through demonstration, and to learn to play these games effectively without further human intervention. To this end, based on our previous work on general game-playing programs (UNSW) and cognitive robotics and planning (Freiburg) we will jointly develop and analyse a mathematical framework for general game-playing robots, implement an automated reasoning system for this framework, and incorporate this into UNSW's fully autonomous, stationary Baxter robot.
Representation and Reasoning for Cognitive Personal Robotics (ARC-DP 2015-2017)
Robotic systems are becoming increasingly more sophisticated and prevalent. Developing complex and maintainable robot programs to control these systems remains a significant challenge particularly given the diversity of robot platforms and application areas. This project builds on advances in problem solving and programming paradigms in Artificial Intelligence, applying them to learning sophisticated robot programs. These techniques provide for elaboration tolerance, knowledge/program maintenance and optimisation of performance. This project will develop techniques for building sophisticated declarative robot programs. It will achieve this by learning procedural robot programs and turning them into maintainable declarative robot programs.
This project investigates how the interactions between human participants and digital characters produce an entirely new type of space, an intra-space, actively created through inter-action, dynamically changed through the process of interaction. By integrating these systems the project pioneers the experimental representation of contemporary architectural space.
Universal Game-Playing Systems for Randomised and Imperfect-Information Games (ARC-DP 2012-2015)
A universal game-player is a computer system that you can tell the rules of any new game and that then all by itself learns to play that game. Building such systems has recently been established as a Grand Challenge for research in Artificial Intelligence. The aim of this project is to develop a universal game-playing system that can learn to play arbitrary games including those with random moves and where players have imperfect information, which is usually the case in real-world games. This will significantly advance the knowledge of this discipline, which today is limited to deterministic games with complete information. This will result in innovative methods and technologies for building universal game-playing systems.
Representing and Reasoning About Ability for Robots to Use the Cloud (ARC-DP 2012-2015)
Robot technologies have developed dramatically, particularly with the reduction in size and cost of computer components and the increase in sophistication of sensors and actuators. Robot software, or more accurately, robot middleware has also increased in sophistication with projects like the Robot Operating System (ROS) now being adopted by the majority of research groups worldwide. However, the desire to limit power usage means that processing capabilities and storage capacity remain bounded. The advent of cloud computing provides a means for addressing these limitations. This project develops techniques for representing and reasoning about robot abilities so that data and algorithms can be stored in the cloud and utilised as required.
Declarative Programming for General Robotics (Go8-DAAD 2012-2013)
The aim of this project is to endow autonomous robots with general intelligence using the methodology of declarative programming.
General intelligence allows autonomous robots to solve new tasks and to function in new environments without the need to be re-programmed. To do so, robots must be able to act rationally solely on the basis of what they know about a given task, about the actions they can perform, and about the effects of these actions. This requires to build an integrated framework for general robotics that combines two cutting-edge Artificial Intelligence technologies:
- A mathematical framework for the automation of rational behavior, decision making, and planning developed at UNSW.
- A methodology and tool for declarative programming (Reactive Answer Set Programming) developed at Potsdam University.
Logical Foundation and Implementation Technology for Automated Negotiation (ARC-DP 2009-2011)
Electronic trading systems rely on multilateral, multi-issue negotiation models. The existing systems, underpinned by classical game theory, are mostly single-issue, numerically based. Qualitative judgements and logical reasoning are missing. In this project, we remedy these glaring deficiencies by providing a theory of bargaining with unified tools of qualitative and quantitative analysis, and use it to enhance the power and intelligibility of current systems. An extended Game Description Language, a mediation-based negotiation system and an e-trading system for testing bargaining strategies will be implemented. As a bonus, a novel branch of bargaining theory to complement traditional game-theoretic bargaining will emerge.
This joint project with Universities from Aachen, Dresden, Freiburg, and Leipzig aims at combining theories, methods, and systems from four key research areas in Knowledge Representation:
- Action Theory
- Default Reasoning
- Description Logic
FLUX is a high-level programming system for cognitive agents of all kinds, including intelligent agents, autonomous robots, and general game players. FLUX is an implementation of the Fluent Calculus, a versatile action theory deriving from the Situation Calculus.