On the Effective Distribution and Maintenance of Knowledge Represented by Complementary Graphs

Kotulski, Leszek; Sędziwy, Adam

doi:10.1007/978-3-642-29356-6_5

Cited by 4 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thanks to replicated complementary graphs concept [7,9] graph-based representation is decomposable and may be distributed for parallel processing. The compliance ratio for subgraphs produced by the relaxation algorithm of decomposition reaches 98% [6]. Our approach enables introducing additional, auxiliary entities (agents, robots) like induction-loop traffic sensors or daylight sensors.…”

Section: Distributed Agent Aided Lighting Designmentioning

confidence: 97%

Solving Large-Scale Multipoint Lighting Design Problem Using Multi-Agent Environment

Sędziwy¹,

Kotulski²

2011

KEM

View full text Add to dashboard Cite

In the paper we focus on the problem of large-scale distribution of lighting points. Its solution is constrained by economic issues like power consumption or exploitation costs and, on the other side, by the computational complexity of design process. Multi-agent computational environment combined with graph and hypergraph representations of a problem allow meeting design requirements and objectives and, on the other hand, make the method applicable for large systems for which computational effectiveness is a crucial factor.

show abstract

Section: Distributed Agent Aided Lighting Designmentioning

confidence: 97%

Solving Large-Scale Multipoint Lighting Design Problem Using Multi-Agent Environment

Sędziwy¹,

Kotulski²

2011

KEM

View full text Add to dashboard Cite

show abstract

“…In Nikodem and Strug (2004), an evolutionary approach has been used in the optimisation of trusses. Due to a large size of many graphs in real-life tasks, an approach based on distributing graphs and hypergraphs and to using multi-agent systems, was developed in Kotulski (2008aKotulski ( , 2008b, Kotulski andStrug (2007, 2011) and Kotulski and Sędziwy (2010a, 2010b, 2012.…”

Section: Related Workmentioning

confidence: 99%

“…In order to represent the design process such a hypergraph transformation system can be defined having rules (productions) corresponding to all actions that can be applied in a given design task. While this approach is well defined and has been successfully used in many design problems (Kotulski and Sędziwy, 2012;Kotulski andStrug, 2011, 2013), its main problem is a need for a huge number of productions in a more complex, real life design problems. The solution to this problem that we proposed is the use of a system of graph transformations with a single graph transformation system is defined for each part of the design.…”

Section: Design Modificationmentioning

confidence: 99%

Synchronisation methods in graph-based knowledge representation for large-scale design process

Kotulski

S�

dziwy

et al. 2017

IJDE

Self Cite

View full text Add to dashboard Cite

Automation is an important issue in computer-aided design systems. One of the most important issues in achieving such an objective is an appropriate knowledge representation. Graphs and graph-based formalisms constitute a mean which allows for an effective representation of designs. On the basis of graphs representing the structure (static) of the design, graph grammars are a tool allowing to represent the dynamics of the design process. In this paper, we present an approach to the synchronisation of different aspects within the design process carried out by different and independent transformation systems supporting different aspects of the design. Such a synchronisation is required every time one of the systems tries to modify an area shared with the other one. The proposed mechanism is illustrated by an example of successful synchronisation in shared areas or on shared elements of the object being designed. The objective has been achieved by using different representations at different layers of the design.

show abstract

“…Depending on particular cases, the reduction can be substantial; however, introducing another entity or factor of uncertainty can trigger the growth of the state space beyond the capabilities of the reduction process. There is also ongoing research regarding efficient graph processing solutions that take distributed and parallel processing into consideration [12].…”

Section: The Complexity Of Multi-dimensional Planningmentioning

confidence: 99%

A Robust Planning Algorithm for Groups of Entities in Discrete Spaces

Wojnicki

Ernst

Turek

2015

Entropy

View full text Add to dashboard Cite

Automated planning is a well-established field of artificial intelligence (AI), with applications in route finding, robotics and operational research, among others. The task of developing a plan is often solved by finding a path in a graph representing the search domain; a robust plan consists of numerous paths that can be chosen if the execution of the best (optimal) one fails. While robust planning for a single entity is rather simple, development of a robust plan for multiple entities in a common environment can lead to combinatorial explosion. This paper proposes a novel hybrid approach, joining heuristic search and the wavefront algorithm to provide a plan featuring robustness in areas where it is needed, while maintaining a low level of computational complexity.

show abstract

On the Effective Distribution and Maintenance of Knowledge Represented by Complementary Graphs

Cited by 4 publications

References 12 publications

Solving Large-Scale Multipoint Lighting Design Problem Using Multi-Agent Environment

Solving Large-Scale Multipoint Lighting Design Problem Using Multi-Agent Environment

Synchronisation methods in graph-based knowledge representation for large-scale design process

A Robust Planning Algorithm for Groups of Entities in Discrete Spaces

Contact Info

Product

Resources

About