Combining influence maps and cellular automata for reactive game agents

Agents make up an important part of game worlds, ranging from the characters and monsters that live in the world to the armies that the player controls. Despite their importance, agents in current games rarely display an awareness of their environment or react appropriately, which severely detracts from the believability of the game. Some games have included agents with a basic awareness of other agents, but they are still unaware of important game events or environmental conditions. This paper presents an agent design we have developed, which combines cellular automata for environmental modeling with influence maps for agent decision-making. The agents were implemented into a 3D game environment we have developed, the EmerGEnT system, and tuned through three experiments. The result is simple, flexible game agents that are able to respond to natural phenomena (e.g. rain or fire), while pursuing a goal.

Levinasian ethics and the representation of the other in international and cross-cultural management

In this paper, we seek to further the discussion, problematization and critique of west/east identity relations in ICM studies by considering the ethics of the relationship – an issue never far beneath the surface in discussions of Orientalism. In particular we seek to both examine and question the ethics of representation in relation to a critique of what has come to be known as international and cross-cultural management (ICM). To pursue such a discussion, we draw specifically on the ethical elaborations of Emmanuel Levinas as well as his chief interlocutors Jacques Derrida and Zygmunt Bauman. The value of this discussion, we propose, is that Levinas offers a philosophy that holds as its central concept the relationship between the self and Other as the primary ethical and pre-ontological relation. Levinas’ philosophy provides a means of extending the post-colonial critique of ICM, and ICM provides a context in which the Levinasian ethics can be brought to bear on a significant issue on contemporary business and management.

Termination of real-time programs: Definitely, definitely not, or maybe

Real-time control programs are often used in contexts where (conceptually) they run forever. Repetitions within such programs (or their specifications) may either (i) be guaranteed to terminate, (ii) be guaranteed to never terminate (loop forever), or (iii) may possibly terminate. In dealing with real-time programs and their specifications, we need to be able to represent these possibilities, and define suitable refinement orderings. A refinement ordering based on Dijkstra's weakest precondition only copes with the first alternative. Weakest liberal preconditions allow one to constrain behaviour provided the program terminates, which copes with the third alternative to some extent. However, neither of these handles the case when a program does not terminate. To handle this case a refinement ordering based on relational semantics can be used. In this paper we explore these issues and the definition of loops for real-time programs as well as corresponding refinement laws.