Loading...
Search for: heuristic-functions
0.008 seconds

    Implementing heterogeneous agents in dynamic environments, a case study in RoboCupRescue

    , Article First German Conference, MATES 2003, Erfurt, 22 September 2003 through 25 September 2003 ; Volume 2831 , 2003 , Pages 95-104 ; 03029743 (ISSN) Habibi, J ; Ahmadi, M ; Nouri, A ; Sayyadian, M ; Nevisi, M. M ; Sharif University of Technology
    Springer Verlag  2003
    Abstract
    Design and construction of multi-agent systems is a challenging but an intriguing problem. It is because of the intrinsic distribution of the intelligent components. In such environments the interaction and communication between the constituent parts extends the complexity since appropriate coordination methods need to be designated and employed. In this paper a successful experiment in designing and implementing such an environment is presented1. The test bed for this research is the rescue simulation environment. The architecture of the implemented heterogeneous agents takes advantage of various algorithms. These algorithms make the agents act intelligently by themselves albeit they happen... 

    Using satisfiability for non-optimal temporal planning

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 7519 Lnai , 2012 , Pages 176-188 ; 03029743 (ISSN) ; 9783642333521 (ISBN) Rankooh, M. F ; Mahjoob, A ; Ghassem-Sani, G ; Sharif University of Technology
    Springer  2012
    Abstract
    AI planning is one of the research fields that has benefited from employing satisfiability checking methods. These methods have been proved to be very effective in finding optimal plans for both classical and temporal planning. It is also known that by using planning-based heuristic information in solving SAT formulae, one can develop SAT-based planners that are competitive with state-of-the-art non-optimal planners in classical planning domains. However, using satisfiability for non-optimal temporal planning has not been investigated so far. The main difficulty in using satisfiability in temporal planning is the representation of time, which is a continuous concept. Previously introduced... 

    Directing the search in the fast forward planning

    , Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 857-861 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Akramifar, A ; Ghassem Sani, G. R ; Sharif University of Technology
    2008
    Abstract
    In this paper, we introduce DiFF, a novel extension of the Fast Forward (FF) planning system. FF is a domain independent planner that employs a forward heuristic search. Its search strategy is an enforced form of hill climbing. In order to move to a more promising state, FF evaluates successor states without any particular order. In this paper, we introduce a new form of the enforced hill climbing, which we call directed enforced hill climbing, to enhance the efficiency of Fast Forward planning. This strategy evaluates successor states in the order recommended by an adaptive heuristic function. Our experimental results in several planning domains show a significant improvement in the...