wastewater planning management is a complex problem involving agricultural, rural and industrial interests. in countries facing rapid population growth, identifying methods that can allow them to take good decisions among several competitive alternatives is of utmost importance. the purpose of this paper is to present a methodology for a wastewater planning management system using a multi-c...

Projects play key roles in most modern industries and firms. The management of these economic activities, project management, is continuously developed and today considered to be at the center of competitive advantage. Much classic research on project management has, however, focused on the planning and scheduling activities of project management. Traditional writings within the area even seem ...

This paper presents an application of Monte-Carlo planning for controlling units in a RTS game StarCraft. We developed an original simulator for applying Monte-Carlo Planning (MCPlan) to solve the problem of random and simultaneous moves in the RTS game. We also apply an greedy   algorithm to model the opponent in a simulation for improving MCPlan’s performance. Experimental results are provi...

Computer games are an increasingly popular application for Artificial Intelligence (AI) research, and conversely AI is an increasingly popular selling point for commercial games. Although games are typically associated with entertainment, there are many “serious” applications of gaming, including military, corporate, and advertising applications. There are also so-called “humane” gaming applica...

This paper describes the application of Artificial Intdligenre planning techniques to the problem of antenna track plan generation for a NASA Deep Space CommunicationJ Station. The described system enables an antenna communicatiwnJ station to automatically re,pond to a set of tracking goals by correctly configuring the appropriate hardware and software to provide the requested communication ser...

This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a stochastic game formulation of these problems in which tasks have varying hard deadlines and processing requirements. We then introduce a new technique for approximating this game using a series of static potential games, before detailing a decentralised...

This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these problems for tasks with varying hard deadlines and processing requirements. We then introduce a new technique for approximating this game using a series of static potential games, before detailing a decentralised solution...