Kutluhan Erol

Kutluhan Erol
Izmir University of Economics · computer engineering

Doctor of Philosophy

About

30
Publications
3,496
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
2,046
Citations
Citations since 2017
2 Research Items
283 Citations
201720182019202020212022202301020304050
201720182019202020212022202301020304050
201720182019202020212022202301020304050
201720182019202020212022202301020304050

Publications

Publications (30)
Conference Paper
Full-text available
The main focus of this research is to uncover the underlying intuitive knowledge of architecture with the help of machine learning models. To achieve this, a generic architectural design process is considered and divided into iterative portions based on their output for each phase. This study looks into the initial portion of the architectural desi...
Article
Full-text available
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete.
Article
Full-text available
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantic...
Article
Full-text available
Most practical work on AI planning systems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks, and how it c...
Article
Multi-agent problem solving using market mechanisms is a primary focus area of Intelligent Automation Inc. We have been developing agent-based planning and scheduling techniques, and investigating their feasibility in manufacturing and transportation domains. These domains involve online streams of jobs being executed in dynamic and uncertain envir...
Article
Vehicle routing problems (VRP's) involve assigning a fleet of limited capacity service vehicles to service a set of customers. This paper describes an innovative, agent-based approach to solving a real-world vehicle-routing problem embedded in a highly dynamic, unpredictable domain. Most VRP research, and all commercial products for solving VRP's,...
Article
Recent interest in distributed agent-based control systems for dynamic, unpredictable application domains has been motivated largely by the increased responsiveness of independent entities that can react locally to changes in the operating environment. The agent-oriented paradigm for software engineering provides a basis for the construction of ext...
Conference Paper
Full-text available
In this paper, we describe an approach to agent design using a three-tier architecture that promotes composing agents from reusable components. We also present a CASE tool called DIVA TM that allows software engineers to compose and modify such design documents, and automates their transition to implementation. DIVA is integrated with Rose TM from...
Article
Full-text available
The economic impact of traffic management grows each day. Infrastructure improvements are costly, hence any such project must be carefully evaluated for its impact on the traffic. Emphasis on traffic simulation tools has increased in the last five years to help evaluate new traffic-control strategies, as well as planned road constructions. Building...
Article
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators.
Article
Full-text available
Major market trends are driving the manufacturing complex from mass production, where the manufacturer tells the customer what to buy, to mass customization, where the customer tells the manufacturing complex what to make. The Internet supports this transformation with global communication between customers and manufacturers. However, the physical...
Article
AI planning techniques are beginning to find use in a number of practical planning domains. However, the backward-chaining and partial-order-planning control strategies traditionally used in AI planning systems are not necessarily the best ones to use for practical planning problems. In this paper, we discuss some of the difficulties that can resul...
Article
Full-text available
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantic...
Article
This paper compares three commitment strategies for HTN planning: (1) a strategy that delays variable bindings as much as possible; (2) a strategy in which no non-primitive task is expanded until all variable constraints are committed; and (3) a strategy that chooses between expansion and variable instantiation based on the number of branches that...
Article
Full-text available
We describe how video data can be organized and structured so as to facilitate efficient querying. We develop a formal model for video data and show how spatial data structures, suitably modified, provide an elegant way of storing such data. We develop algorithms to process various kinds of video queries and show that, in most cases, the complexity...
Conference Paper
Full-text available
This paper compares three commitment strategies for HTN planning: (1) a strategy that delays variable bind- ings as much as possible; (2) a strategy in which no non-primitive task is expanded until all variable con- straints are committed; and (3) a strategy that chooses between expansion and variable instantiation based on the number of branches t...
Article
Full-text available
The last twenty years of AI planning research has discovered a wide variety of planning techniques such as state-space search, hierarchical planning, case-based planning and reactive planning. These techniques have been implemented in numerous planning systems (e.g., [12, 8, 9, 10, 11]). Initially, a number of simple toy domains have been devised t...
Article
Full-text available
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators.We show conditions under which planning is decidable and undecidable. Our results on this topic solve an open problem posed by Chapman (1987), and clear up some difficulties with his undecidability...
Article
Full-text available
Detecting interactions and resolving conflicts is one of the key issues for generative planning systems. Hierarchical Task Network (HTN) planning systems use critics for this purpose. Critics have provided extra efficiency and flexibility to HTN planning systems, but their procedural --and sometimes domain-specific -- nature has not been amenable t...
Article
Thesis (Ph. D.)--University of Maryland at College Park, 1995. Thesis research directed by Dept. of Computer Science. Includes bibliographical references (leaves 247-256).
Article
Full-text available
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks.
Chapter
In this paper, we show conditions under which planning is decidable and undecidable. Our results on this topic solve an open problem posed in (Chapman 1987), and clear up some difficulties with his undecidability theorems.
Conference Paper
In this paper, we examine how the complexity of domain-independent planning with strips-style operators depends on the nature of the planning operators. We show how the time complexity varies depending on a wide variety of conditions: • whether or not delete lists are allowed; • whether or not negative preconditions are al- lowed; • whether or not...
Article
Full-text available
In this paper, we show conditions under which planning is decidable and undecidable. Our results on this topic solve an open prob-lem posed in (Chapman 1987), and clear up some difficulties with his undecidability the-orems.

Network

Cited By