Martijn C. Schut

Martijn C. Schut

Auto-generated profile, based on publicly available information

Martijn C. Schut

Vrije Universiteit Amsterdam

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2004 in Journal of Experimental & Theoretical Artificial Intelligence
Verified
Journal Article
Closed access
MSMartijn Schut
Martijn Schut
MWMichael Wooldridge
Michael Wooldridge
Simon ParsonsSimon Parsons
Simon Parsons
One of the key problems in the design of belief-desire-intention (BDI) agents is that of finding an appropriate policy for intention reconsideration. Crudely, the idea is that at any given time, an agent will have a number of intentions, relating to states of affairs that the agent has committed to bring about. An agent chooses plans that are appropriate for bringing about these intentions; if a particular plan for a given intention fails, then the agent will typically replan, to find an alternative course of action for this intention. However, a rational agent's intentions will not be static. From time-to-time, it makes sense for such an agent to reconsider its intentions, for example when the intention is doomed never to be realized, or else when the agent would simply profit from adopting another, more fruitful goal. This paper presents a detailed investigation of the properties of intention reconsideration. The work builds on the foundational work of Kinny and Georgeff, who investigated the properties of various intention reconsideration strategies in environments that were to varying degrees dynamic, i.e. subject to unanticipated change. The present paper broadly falls into two distinct parts. In the first part, the authors extend work of Kinny and Georgeff, by investigating the properties of intention reconsideration strategies in environments that are also to varying degrees (in)accessible and (non-)deterministic. They then investigate two different models of intention reconsideration. In the first model, intention reconsideration is modelled as a process of discrete deliberation scheduling: intention reconsideration is modelled as an action that may be performed by an agent, and so lends itself to analysis in terms of conventional decision theoretic models of optimal action. In the second, intention reconsideration is modelled as a partially observable Markov decision process (POMDP): solving the POMDP means finding an optimal intention reconsideration policy.

16 May 2012 in Genetic Programming and Evolvable Machines
Verified
Journal Article
Closed access
PDF file
GNG. S. Nitschke
G. S. Nitschke
AEA. E. Eiben
A. E. Eiben
MSM. C. Schut
M. C. Schut

12 July 2002
Verified
Book Chapter
Closed access
PDF file
MSMartijn Schut
Martijn Schut
MWMichael Wooldridge
Michael Wooldridge
SPSimon Parsons
Simon Parsons

1 October 2005 in SIMULATION
Verified
Journal Article
Closed access
TBTibor Bosse
Tibor Bosse
CJCatholijn M. Jonker
Catholijn M. Jonker
MSMartijn C. Schut
Martijn C. Schut
JTJan Treur
Jan Treur
Some types of animals exploit patterns created in the environment as external mental states, thus obtaining an extension of their mind. In the case of social animals, the creation and exploitation of such patterns can be shared, which supports a form of shared extended mind or collective intelligence. This article explores this shared extended mind principle for social animals in more detail. The focus is on formal analysis and formalization of the dynamic properties of the processes involved, both at the local level (the basic mechanisms) and the global level (the emerging properties of the whole), and their relationships. A case study in social ant behavior in which the shared extended mind plays an important role is used as an illustration. For this case, simulations are described based on specifications of local properties, and global properties are specified and verified.

1 April 2007
Verified
Conference Paper
Closed access
AEA.E. Eiben
A.E. Eiben
GNG.S. Nitschke
G.S. Nitschke
MSM.C. Schut
M.C. Schut
In this research, a neuro-evolution method called collective neuro-evolution (CONE), is introduced for the design of neural controllers (agents) operating in collective behavior task domains. The efficacy of the CONE method for facilitating emergent behavioral specialization for the benefit of increasing task performance is tested in a pursuit-evasion and collective gathering task. For a comparative study, a conventional neuro-evolution method was applied to the same tasks. In both tasks, the CONE method derived behavioral specialization in groups of agents resulting in higher task performances, where as the conventional neuro-evolution method was unable to derive specialization resulting in comparatively lower task performances

1 December 2005
Verified
Conference Paper
Closed access
AEA.E. Eiben
A.E. Eiben
GNG.S. Nitschke
G.S. Nitschke
MSM.C. Schut
M.C. Schut
The research goal was to engineer an agent collective that most effectively accomplished a cooperative gathering task. The proper setting of agent controller parameters was vital for the finding of agent behavior that most effectively gathered a high quantity and quality of resources in an unknown virtual environment. We tested the efficacy of evolutionary design of agent controller parameters, via testing evolved parameters in a non-evolutionary control experiment. The effectiveness of evolutionary design for the given task was further supported by comparing evolved parameters with a quality space sampling methodology that explored the parameter space for regions that produced a high value gathered cooperatively for the agent collective. Results indicated that the evolutionary approach was able to find agent controller settings for accomplishing the task with a high level of performance