362 research outputs found
A Descriptive Model of Robot Team and the Dynamic Evolution of Robot Team Cooperation
At present, the research on robot team cooperation is still in qualitative
analysis phase and lacks the description model that can quantitatively describe
the dynamical evolution of team cooperative relationships with constantly
changeable task demand in Multi-robot field. First this paper whole and static
describes organization model HWROM of robot team, then uses Markov course and
Bayesian theorem for reference, dynamical describes the team cooperative
relationships building. Finally from cooperative entity layer, ability layer
and relative layer we research team formation and cooperative mechanism, and
discuss how to optimize relative action sets during the evolution. The dynamic
evolution model of robot team and cooperative relationships between robot teams
proposed and described in this paper can not only generalize the robot team as
a whole, but also depict the dynamic evolving process quantitatively. Users can
also make the prediction of the cooperative relationship and the action of the
robot team encountering new demands based on this model. Journal web page & a
lot of robotic related papers www.ars-journal.co
ΠΠ³ΡΠ΅ΡΠΈΠ²Π½ΠΎΠ΅ ΠΈ ΠΌΠΈΡΠ½ΠΎΠ΅ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ Π² ΠΌΠ½ΠΎΠ³ΠΎΠ°Π³Π΅Π½ΡΠ½ΡΡ ΡΠΈΡΡΠ΅ΠΌΠ°Ρ Π² ΠΊΠ»Π΅ΡΠΎΡΠ½ΠΎΠΉ ΡΡΠ΅Π΄Π΅
Π Π°Π³Π΅Π½ΡΠ½ΠΎ-ΠΎΡΡΡΠ½ΡΠΎΠ²Π°Π½ΠΎΠΌΡ ΠΏΡΠ΄Ρ
ΠΎΠ΄Ρ Π²ΠΈΠ΄ΡΠ»Π΅Π½ΠΎ ΠΊΠΎΠ½ΡΠΎΠ»ΡΠ΄Π°ΡΡΡ Π²Π΅Π»ΠΈΠΊΠΎΡ ΡΡΠ·Π½ΠΎΠΌΠ°Π½ΡΡΠ½ΠΎΡΡΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ. Π ΠΎΠ·ΡΠΎΠ±Π»Π΅Π½Ρ ΠΌΠΎΠ΄Π΅Π»Ρ Π±Π°Π³Π°ΡΡΠΎΡ
Π΄ΠΎΡΠ»ΡΠ΄Π½ΠΈΠΊΡΠ² Ρ ΠΎΠ΄Π½ΠΎΡΠΈΠΏΠ½ΠΈΠΌΠΈ Π·Π° ΠΎΡΠ½ΠΎΠ²Π½ΠΈΠΌΠΈ ΠΎΠ·Π½Π°ΠΊΠ°ΠΌΠΈ, ΠΏΡΠΎΡΠ΅ Ρ ΡΡΠ΅ΡΡ ΡΠΊΠ»Π°Π΄Π½ΠΈΡ
Π°Π΄Π°ΠΏΡΠΈΠ²Π½ΠΈΡ
ΡΠΈΡΡΠ΅ΠΌ ΡΠ°ΠΊΠΈΡ
, ΡΠΊ ΡΡΡΡΠ½Ρ Π΅ΠΊΠΎΠ»ΠΎΠ³ΡΡ Π½Π΅Π·Π½Π°ΡΠ½Π° Π²ΡΠ΄ΠΌΡΠ½Π½ΡΡΡΡ Π² Π°ΡΡ
ΡΡΠ΅ΠΊΡΡΡΡ ΡΠΈ ΡΡΠ·Π½ΠΈΡΡ Π·Π½Π°ΡΠ΅Π½Ρ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΡΠ² ΠΌΠΎΠΆΡΡΡ Π²ΡΠ΄ΡΡΡΠ½ΠΎ Π²ΠΏΠ»ΠΈΠ²Π°ΡΠΈ Π½Π° Π΅ΠΌΠ΅ΡΠ΄ΠΆΠ΅Π½ΡΠ½Ρ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΌΠΎΠ΄Π΅Π»Ρ. ΠΠ΅ΡΡΠΎΠ²ΡΠ΄ΠΊΡΠΈΠ²Π°ΡΠ°ΠΌΠΈ Π°Π³Π΅Π½ΡΠ½ΠΎΠ³ΠΎ ΠΏΡΠ΄Ρ
ΠΎΠ΄Ρ Π΄ΠΎ ΡΡΡΡΠ½ΠΈΡ
Π΅ΠΊΠΎΡΠΈΡΡΠ΅ΠΌ Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ Ρ Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ Π·Π°Π·Π½Π°ΡΠ΅Π½ΠΎ, ΡΠΎ Π½Π°ΡΠ²Π½Π° ΠΌΠ½ΠΎΠΆΠΈΠ½Π° Π±Π°Π³Π°ΡΠΎΠ°Π³Π΅Π½ΡΠ½ΠΈΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΠΏΠΎΡΡΠ΅Π±ΡΡ Π²ΠΏΡΠΎΠ²Π°Π΄ΠΆΠ΅Π½Π½Ρ ΡΠ΅Ρ
Π½ΡΠΊ ΡΠ° ΠΌΠ΅ΡΠΎΠ΄ΠΈΠΊ, ΡΠΎ Π΄ΠΎΠ·Π²ΠΎΠ»ΡΡΡ ΡΠ·Π°Π³Π°Π»ΡΠ½ΠΈΡΠΈ ΡΡ
ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΈ. ΠΠΎΠ΄Π°Π½ΠΎ ΠΌΠΎΠ΄Π΅Π»Ρ, ΡΠΎ Ρ ΡΠ΅ΠΏΠ»ΡΠΊΠ°ΡΡΡΡ ΡΠΆΠ΅ ΡΡΠ½ΡΡΡΠΎΡ Ρ ΠΏΠΎΠ΄ΡΠ±Π½ΠΎΡ Π΄ΠΎ ΠΊΠ»Π°ΡΠΈΡΠ½ΠΈΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΡΡΡΠ½ΠΎΠ³ΠΎ ΠΆΠΈΡΡΡ Ρ ΠΊΠ»ΡΡΠΈΠ½Π½ΠΎΠΌΡ ΠΏΡΠΎΡΡΠΎΡΡ. ΠΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ Π·Π°Π»Π΅ΠΆΠ½ΡΡΡΡ Π°Π³ΡΠ΅ΡΠΈΠ²Π½ΠΎΡ ΡΠ° ΠΌΠΈΡΠ½ΠΎΡ ΠΏΠΎΠ²Π΅Π΄ΡΠ½ΠΊΠΈ Π²ΡΠ΄ ΠΊΡΠ»ΡΠΊΠΎΡΡΡ ΡΠ΅ΡΡΡΡΡ, ΡΠΎ Π½Π°Π΄Ρ
ΠΎΠ΄ΠΈΡΡ Π΄ΠΎ ΡΠΈΡΡΠ΅ΠΌΠΈ. ΠΠΎΡΡΠ²Π½ΡΠ½ΠΎ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΈ ΠΏΠΎΡΠΎΡΠ½ΠΎΡ ΠΌΠΎΠ΄Π΅Π»Ρ-ΡΠ΅ΠΏΠ»ΡΠΊΠ°ΡΡΡ ΡΠ° ΡΡ ΠΏΡΠΎΡΠΎΡΠΈΠΏΡ, Π·Π°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎΠ³ΠΎ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ ΡΠ° ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ Ρ ΠΌΠ΅ΡΠΎΠ΄Ρ "ΡΡΠΈΠΊΡΠ²Π°Π½Π½Ρ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ".One of the key issues in Multi-Agent simulation approach is a consolidation of great model variety. Many researches govern own unique models that are similar in basic principles but for complex adaptive systems such as Artificial Ecosystems slight difference in architecture and parameters calibration could affect crucially on the emergent properties of the model. As it was denoted by the pioneers of the Artificial Ecosystems modelling Robert Axtell and Robert Axelrod: variety of Multi-Agent models need introduction of methods and technics that allows consolidating of its results. In work we present modification of model similar to classic Artificial Life spatial lattice models and trace the exhibition of aggressive and peaceful behavior depending on the income resource. We consider results of both modelsβ simulation as it was proposed in "docking models" method by Axtell and Axelrod.Π Π°Π³Π΅Π½ΡΠ½ΠΎ-ΠΎΡΠΈΠ΅Π½ΡΠΈΡΠΎΠ²Π°Π½Π½ΠΎΠΌ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π΅ Π²ΡΠ΄Π΅Π»Π΅Π½Π° ΠΊΠΎΠ½ΡΠΎΠ»ΠΈΠ΄Π°ΡΠΈΡ Π±ΠΎΠ»ΡΡΠΎΠ³ΠΎ ΡΠ°Π·Π½ΠΎΠΎΠ±ΡΠ°Π·ΠΈΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ. Π Π°Π·ΡΠ°Π±ΠΎΡΠ°Π½Π½ΡΠ΅ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΠΌΠ½ΠΎΠ³ΠΈΡ
ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»Π΅ΠΉ ΡΠ²Π»ΡΡΡΡΡ ΠΎΠ΄Π½ΠΎΡΠΈΠΏΠ½ΡΠΌΠΈ ΠΏΠΎ ΠΎΡΠ½ΠΎΠ²Π½ΡΠΌ ΠΏΡΠΈΠ·Π½Π°ΠΊΠ°ΠΌ, ΠΎΠ΄Π½Π°ΠΊΠΎ Π² ΡΡΠ΅ΡΠ΅ ΡΠ»ΠΎΠΆΠ½ΡΡ
Π°Π΄Π°ΠΏΡΠΈΠ²Π½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ ΡΠ°ΠΊΠΈΡ
, ΠΊΠ°ΠΊ ΠΈΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΡΠ΅ ΡΠΊΠΎΠ»ΠΎΠ³ΠΈΠΈ Π½Π΅Π·Π½Π°ΡΠΈΡΠ΅Π»ΡΠ½ΠΎΠ΅ ΠΎΡΠ»ΠΈΡΠΈΠ΅ Π² Π°ΡΡ
ΠΈΡΠ΅ΠΊΡΡΡΠ΅ ΠΈΠ»ΠΈ ΡΠ°Π·Π½ΠΈΡΠ° Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΎΠ² ΠΌΠΎΠ³ΡΡ ΠΈΠΌΠ΅ΡΡ Π΄ΠΎΡΡΠ°ΡΠΎΡΠ½ΠΎ Π±ΠΎΠ»ΡΡΠΎΠ΅ Π²Π»ΠΈΡΠ½ΠΈΠ΅ Π½Π° ΡΠΌΠ΅ΡΠ΄ΠΆΠ΅Π½ΡΠ½ΡΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΌΠΎΠ΄Π΅Π»ΠΈ. ΠΠ΅ΡΠ²ΠΎΠΎΡΠΊΡΡΠ²Π°ΡΠ΅Π»ΡΠΌΠΈ Π°Π³Π΅Π½ΡΠ½ΠΎΠ³ΠΎ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π° Π² ΠΈΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΡΡ
ΡΠΊΠΎΡΠΈΡΡΠ΅ΠΌΠ°Ρ
Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ ΠΈ Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ ΠΎΡΠΌΠ΅ΡΠ΅Π½ΠΎ, ΡΡΠΎ ΠΈΠΌΠ΅ΡΡΠ΅Π΅ΡΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²ΠΎ ΠΌΠ½ΠΎΠ³ΠΎΠ°Π³Π΅Π½ΡΠ½ΡΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΡΠ΅Π±ΡΠ΅Ρ Π²Π½Π΅Π΄ΡΠ΅Π½ΠΈΡ ΡΠ΅Ρ
Π½ΠΈΠΊ ΠΈ ΠΌΠ΅ΡΠΎΠ΄ΠΈΠΊ, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΡ ΠΎΠ±ΠΎΠ±ΡΠΈΡΡ ΠΈΡ
ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ. ΠΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π° ΠΌΠΎΠ΄Π΅Π»Ρ, ΠΊΠΎΡΠΎΡΠ°Ρ ΡΠ²Π»ΡΠ΅ΡΡΡ ΡΠ΅ΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠ΅ΠΉ ΡΠΆΠ΅ ΡΡΡΠ΅ΡΡΠ²ΡΡΡΠ΅ΠΉ ΠΈ ΠΏΠΎΠ΄ΠΎΠ±Π½Π° ΠΊΠ»Π°ΡΡΠΈΡΠ΅ΡΠΊΠΈΠΌ ΠΌΠΎΠ΄Π΅Π»ΡΠΌ ΠΈΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΠΎΠΉ ΠΆΠΈΠ·Π½ΠΈ Π² ΠΊΠ»Π΅ΡΠΎΡΠ½ΠΎΠΌ ΠΏΡΠΎΡΡΡΠ°Π½ΡΡΠ²Π΅. ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½Π° Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΡ Π°Π³ΡΠ΅ΡΡΠΈΠ²Π½ΠΎΠ³ΠΎ ΠΈ ΠΌΠΈΡΠ½ΠΎΠ³ΠΎ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΡ Π² Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΠΈ ΠΎΡ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²Π° ΡΠ΅ΡΡΡΡΠ°, ΠΏΠΎΡΡΡΠΏΠ°ΡΡΠ΅Π³ΠΎ Π² ΡΠΈΡΡΠ΅ΠΌΡ. ΠΡΠΎΠ²Π΅Π΄Π΅Π½ΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΠ΅ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΎΠ² ΡΠ΅ΠΊΡΡΠ΅ΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ-ΡΠ΅ΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠΈ ΠΈ Π΅Π΅ ΠΏΡΠΎΡΠΎΡΠΈΠΏΠ°, ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎΠ³ΠΎ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ ΠΈ ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ Π² ΠΌΠ΅ΡΠΎΠ΄Π΅ "ΡΡΡΠΊΠΎΠ²ΠΊΠ° ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ"
ΠΠΈΠ½Π°ΠΌΠΈΠΊΠ° Π³Π΅Π½ΠΎΡΠΈΠΏΠ° Π² Π½Π΅ΠΉΡΠΎΡΠ²ΠΎΠ»ΡΡΠΈΠΈ Π°Π³Π΅Π½ΡΠΎΠ² Π² ΠΌΠΎΠ΄Π΅Π»ΡΡ ΠΈΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΠΎΠΉ ΠΆΠΈΠ·Π½ΠΈ
ΠΠΎΠΎΠΏΠ΅ΡΠ°ΡΠΈΠ²Π½Π° ΠΏΠΎΠ²Π΅Π΄ΡΠ½ΠΊΠ° Ρ ΠΎΠ΄Π½ΡΡΡ Π· Π½Π°ΠΉΠ±ΡΠ»ΡΡ ΡΠ°ΡΡΠΎ Π²ΠΈΠΊΠΎΡΠΈΡΡΠΎΠ²ΡΠ²Π°Π½ΠΈΡ
ΡΠ° ΠΏΠΎΡΠΈΡΠ΅Π½ΠΈΡ
ΡΠΈΡ Π΄Π»Ρ Π±Π°Π³Π°ΡΠΎΠ°Π³Π΅Π½ΡΠ½ΠΈΡ
ΡΠΈΡΡΠ΅ΠΌ. Π£ Π΄Π΅ΡΠΊΠΈΡ
Π²ΠΈΠΏΠ°Π΄ΠΊΠ°Ρ
ΠΏΠΎΡΠ²Π° ΡΠ°ΠΊΠΎΡ ΠΏΠΎΠ²Π΅Π΄ΡΠ½ΠΊΠΈ ΠΏΠΎΠ²βΡΠ·Π°Π½Π° ΡΠ· ΠΏΠΎΠ΄ΡΠ»ΠΎΠΌ Π½Π°ΡΠ΅Π»Π΅Π½Π½Ρ Π½Π° ΡΠΏΡΠ²ΡΡΠ½ΡΡΡΡ ΡΡΠ±ΠΏΠΎΠΏΡΠ»ΡΡΡΡ [1, 2]. ΠΡΡΠΏΠΎΠ²Π° Π²Π·Π°ΡΠΌΠΎΠ΄ΡΡ ΠΌΠΎΠΆΠ΅ Π½Π°Π±ΡΠ²Π°ΡΠΈ Π½Π΅ Π»ΠΈΡΠ΅ ΡΠΎΡΠΌΠΈ Π°Π½ΡΠ°Π³ΠΎΠ½ΡΡΡΠΈΡΠ½ΠΎΠ³ΠΎ ΠΊΠΎΠ½ΡΠ»ΡΠΊΡΡ, Π°Π»Π΅ ΠΉ Π·ΡΠΌΠΎΠ²Π»ΡΠ²Π°ΡΠΈΡΡ Π³Π΅Π½Π΅ΡΠΈΡΠ½ΠΈΠΌ Π΄ΡΠ΅ΠΉΡΠΎΠΌ, ΡΠΊΠΈΠΉ ΠΏΡΠΈΠ²ΠΎΠ΄ΠΈΡΡ Π΄ΠΎ ΠΊΠΎΠ½ΠΊΡΡΠ΅Π½ΡΡΡ ΠΏΠΎΠ²Π΅Π΄ΡΠ½ΠΊΠΎΠ²ΠΈΡ
ΡΡΡΠ°ΡΠ΅Π³ΡΠΉ ΡΠ° ΠΌΠΎΠΆΠ»ΠΈΠ²ΠΎΡ Π°ΡΠΈΠΌΡΠ»ΡΡΡΡ [3]. ΠΡΠΎΠ΄Π΅ΠΌΠΎΠ½ΡΡΡΠΎΠ²Π°Π½ΠΎ ΡΡΠ·Π½Ρ Π²ΠΈΠ΄ΠΈ Π·Π°Π»Π΅ΠΆΠ½ΠΎΡΡΠ΅ΠΉ ΠΌΡΠΆ Π³ΡΡΠΏΠ°ΠΌΠΈ Π°Π³Π΅Π½ΡΡΠ² ΡΠ° ΡΡ
ΠΏΠΎΠ²Π΅Π΄ΡΠ½ΠΊΠΎΠ²ΠΈΠΌΠΈ ΡΡΡΠ°ΡΠ΅Π³ΡΡΠΌΠΈ. ΠΠΈΠΊΠΎΡΠΈΡΡΠ°Π½ΠΎ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ»ΠΎΠ³ΡΡ ΡΠΏΠΎΡΡΠ΅ΡΠ΅ΠΆΠ΅Π½Π½Ρ Π·Π° Π΄ΠΈΠ½Π°ΠΌΡΠΊΠΎΡ Π°Π³Π΅Π½ΡΠ½ΠΎΠ³ΠΎ Π³Π΅Π½ΠΎΡΠΈΠΏΡ [2], Π²ΡΠ΄ΠΏΠΎΠ²ΡΠ΄Π½ΠΎ Π΄ΠΎ ΡΠΊΠΎΡ ΠΏΠΎΠΏΡΠ»ΡΡΡΡ Ρ ΠΏΡΠΎΡΡΠΎΡΡ Π³Π΅Π½ΠΎΡΠΈΠΏΡΠ² ΠΌΠΎΠΆΠ΅ ΠΌΠ°ΡΠΈ Π²ΠΈΠ³Π»ΡΠ΄ Ρ
ΠΌΠ°ΡΠΈ ΡΠΎΡΠΎΠΊ, ΠΊΠΎΠΆΠ½Π° ΡΠΎΡΠΊΠ° ΡΠΊΠΎΡ Π²ΡΠ΄ΠΏΠΎΠ²ΡΠ΄Π°Ρ ΠΎΠ΄Π½ΡΠΉ ΠΎΡΠΎΠ±ΠΈΠ½Ρ. Π ΠΎΠ·Π³Π»ΡΠ½ΡΡΠΎ Π΄ΠΈΠ½Π°ΠΌΡΠΊΡ ΡΠ΅Π½ΡΡΠΎΡΠ΄Π° Π½Π°ΡΠ΅Π»Π΅Π½Π½Ρ β ΡΠ΅Π½ΡΡΠ° Ρ
ΠΌΠ°ΡΠΈ Π³Π΅Π½ΠΎΡΠΈΠΏΡ. ΠΠ½Π°Π»ΡΠ· ΡΠ°ΠΊΠΈΡ
ΡΡΠ°ΡΠΊΡΠΎΡΡΠΉ ΠΌΠΎΠΆΠ΅ ΡΠΏΡΠΈΡΡΠΈ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ ΡΡΠ·Π½ΠΈΡ
ΡΠ΅ΠΆΠΈΠΌΡΠ² ΡΡΠ½ΡΠ²Π°Π½Π½Ρ ΠΏΠΎΠΏΡΠ»ΡΡΡΡ ΡΠ° ΡΡ
Π·Π°ΡΠΎΠ΄ΠΆΠ΅Π½Π½Ρ.Cooperation behavior is one of the most used and spread Multi-agent system feature. In some cases emergence of this behaviour can be characterized by division of population on co-evolving subpopulations [1], [2]. Group interaction can take not only antagonistic conflict form but also genetic drift that results with strategies competition and assimilation [3]. In this work we demonstrate different relation between agent grouping and they behavior strategies. We use approach proposed in work [2] methodology of agent genotype dynamic tracking, due to this approach the evolving population can be presented in genotype space as a cloud of points where each point corresponds to one individual. In current work consider the movement of population centroid β the center of the genotype cloud. Analysis of such trajectories can shad the light on the regimes of population existence and genesis.ΠΠΎΠΎΠΏΠ΅ΡΠ°ΡΠΈΠ²Π½ΠΎΠ΅ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΎΠ΄Π½ΠΎΠΉ ΠΈΠ· Π½Π°ΠΈΠ±ΠΎΠ»Π΅Π΅ ΡΠ°ΡΡΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΡΠ΅ΠΌΡΡ
ΠΈ ΡΠ°ΡΠΏΡΠΎΡΡΡΠ°Π½Π΅Π½Π½ΡΡ
ΡΠ΅ΡΡ Π΄Π»Ρ ΠΌΠ½ΠΎΠ³ΠΎΠ°Π³Π΅Π½ΡΠ½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ. Π Π½Π΅ΠΊΠΎΡΠΎΡΡΡ
ΡΠ»ΡΡΠ°ΡΡ
ΠΏΠΎΡΠ²Π»Π΅Π½ΠΈΠ΅ ΡΠ°ΠΊΠΎΠ³ΠΎ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΡ ΡΠ²ΡΠ·Π°Π½ΠΎ Ρ ΡΠ°Π·Π΄Π΅Π»Π΅Π½ΠΈΠ΅ΠΌ Π½Π°ΡΠ΅Π»Π΅Π½ΠΈΡ Π½Π° ΡΠΎΡΡΡΠ΅ΡΡΠ²ΡΡΡΠΈΠ΅ ΡΡΠ±ΠΏΠΎΠΏΡΠ»ΡΡΠΈΠΈ [1, 2]. ΠΡΡΠΏΠΏΠΎΠ²ΠΎΠ΅ Π²Π·Π°ΠΈΠΌΠΎΠ΄Π΅ΠΉΡΡΠ²ΠΈΠ΅ ΠΌΠΎΠΆΠ΅Ρ ΠΏΡΠΈΠ½ΠΈΠΌΠ°ΡΡ Π½Π΅ ΡΠΎΠ»ΡΠΊΠΎ ΡΠΎΡΠΌΡ Π°Π½ΡΠ°Π³ΠΎΠ½ΠΈΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠΎΠ½ΡΠ»ΠΈΠΊΡΠ°, Π½ΠΎ ΠΈ ΠΎΠ±ΡΡΠ»oΠ²Π»ΠΈΠ²Π°ΡΡΡΡ Π³Π΅Π½Π΅ΡΠΈΡΠ΅ΡΠΊΠΈΠΌ Π΄ΡΠ΅ΠΉΡΠΎΠΌ, ΠΏΡΠΈΠ²ΠΎΠ΄ΡΡΠΈΠΌ ΠΊ ΠΊΠΎΠ½ΠΊΡΡΠ΅Π½ΡΠΈΠΈ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΡΠ΅ΡΠΊΠΈΡ
ΡΡΡΠ°ΡΠ΅Π³ΠΈΠΉ ΠΈ Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΠΉ Π°ΡΡΠΈΠΌΠΈΠ»ΡΡΠΈΠΈ [3]. ΠΡΠΎΠ΄Π΅ΠΌΠΎΠ½ΡΡΡΠΈΡΠΎΠ²Π°Π½Ρ ΡΠ°Π·Π»ΠΈΡΠ½ΡΠ΅ Π²ΠΈΠ΄Ρ Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΠ΅ΠΉ ΠΌΠ΅ΠΆΠ΄Ρ Π³ΡΡΠΏΠΏΠ°ΠΌΠΈ Π°Π³Π΅Π½ΡΠΎΠ² ΠΈ ΠΈΡ
ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΡΠ΅ΡΠΊΠΈΠΌΠΈ ΡΡΡΠ°ΡΠ΅Π³ΠΈΡΠΌΠΈ. ΠΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½Π° ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ»ΠΎΠ³ΠΈΡ Π½Π°Π±Π»ΡΠ΄Π΅Π½ΠΈΡ Π·Π° Π΄ΠΈΠ½Π°ΠΌΠΈΠΊΠΎΠΉ Π°Π³Π΅Π½ΡΠ½ΠΎΠ³ΠΎ Π³Π΅Π½ΠΎΡΠΈΠΏΠ° [2], ΡΠΎΠ³Π»Π°ΡΠ½ΠΎ ΠΊΠΎΡΠΎΡΠΎΠΉ ΠΏΠΎΠΏΡΠ»ΡΡΠΈΡ ΠΌΠΎΠΆΠ΅Ρ Π±ΡΡΡ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π° Π² ΠΏΡΠΎΡΡΡΠ°Π½ΡΡΠ²Π΅ Π³Π΅Π½ΠΎΡΠΈΠΏΠΎΠ² Π² Π²ΠΈΠ΄Π΅ ΠΎΠ±Π»Π°ΠΊΠ° ΡΠΎΡΠ΅ΠΊ, Π³Π΄Π΅ ΠΊΠ°ΠΆΠ΄Π°Ρ ΡΠΎΡΠΊΠ° ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²ΡΠ΅Ρ ΠΎΠ΄Π½ΠΎΠΉ ΠΎΡΠΎΠ±ΠΈ. Π Π°ΡΡΠΌΠΎΡΡΠ΅Π½Π° Π΄ΠΈΠ½Π°ΠΌΠΈΠΊΠ° ΡΠ΅Π½ΡΡΠΎΠΈΠ΄Π° ΠΏΠΎΠΏΡΠ»ΡΡΠΈΠΈ β ΡΠ΅Π½ΡΡ ΠΎΠ±Π»Π°ΠΊΠ° Π³Π΅Π½ΠΎΡΠΈΠΏΠ°. ΠΠ½Π°Π»ΠΈΠ· ΡΠ°ΠΊΠΈΡ
ΡΡΠ°Π΅ΠΊΡΠΎΡΠΈΠΉ ΠΌΠΎΠΆΠ΅Ρ ΠΏΠΎΠΌΠΎΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΡΠ΅ΠΆΠΈΠΌΠΎΠ² ΡΡΡΠ΅ΡΡΠ²ΠΎΠ²Π°Π½ΠΈΡ ΠΏΠΎΠΏΡΠ»ΡΡΠΈΠΈ ΠΈ ΠΈΡ
Π·Π°ΡΠΎΠΆΠ΄Π΅Π½ΠΈΡ
Competition and collaboration in cooperative coevolution of Elman recurrent neural networks for time - series prediction
Collaboration enables weak species to survive in
an environment where different species compete for limited resources. Cooperative coevolution (CC) is a nature-inspired optimization method that divides a problem into subcomponents and evolves them while genetically isolating them. Problem decomposition is an important aspect in using CC for neuroevolution. CC employs different problem decomposition methods to decompose the neural network training problem into
subcomponents. Different problem decomposition methods have features that are helpful at different stages in the evolutionary process. Adaptation, collaboration, and competition are needed for CC, as multiple subpopulations are used to represent the problem. It is important to add collaboration and competition in CC. This paper presents a competitive CC method for training recurrent neural networks for chaotic time-series prediction. Two different instances of the competitive method are proposed that employs different problem decomposition methods to enforce island-based competition. The results show improvement in the performance of the proposed methods in most cases when compared with standalone CC and other methods from the literature
A novel strategy for power sources management in connected plug-in hybrid electric vehicles based on mobile edge computation framework
This paper proposes a novel control framework and the corresponding strategy for power sources management in connected plug-in hybrid electric vehicles (cPHEVs). A mobile edge computation (MEC) based control framework is developed first, evolving the conventional on-board vehicle control unit (VCU) into the hierarchically asynchronous controller that is partly located in cloud. Elaborately contrastive analysis on the performance of processing capacity, communication frequency and communication delay manifests dramatic potential of the proposed framework in sustaining development of the cooperative control strategy for cPHEVs. On the basis of MEC based control framework, a specific cooperative strategy is constructed. The novel strategy accomplishes energy flow management between different power sources with incorporation of the active energy consumption plan and adaptive energy consumption management. The method to generate the reference battery state-of-charge (SOC) trajectories in energy consumption plan stage is emphatically investigated, fast outputting reference trajectories that are tightly close to results by global optimization methods. The estimation of distribution algorithm (EDA) is employed to output reference control policies under the specific terminal conditions assigned via the machine learning based method. Finally, simulation results highlight that the novel strategy attains superior performance in real-time application that is close to the offline global optimization solutions
Aggressive and peaceful behavior in multiagent systems on cellular space
One of the key issues in Multi-Agent simulation approach is a consolidation of great model variety. Many researches govern own unique models that are similar in basic principles but for complex adaptive systems such as Artificial Ecosystems slight difference in architecture and parameters calibration could affect crucially on the emergent properties of the model. As it was denoted by the pioneers of the Artificial Ecosystems modelling Robert Axtell and Robert Axelrod: variety of Multi-Agent models need introduction of methods and technics that allows consolidating of its results. In work we present modification of model similar to classic Artificial Life spatial lattice models and trace the exhibition of aggressive and peaceful behavior depending on the income resource. We consider results of both modelsβ simulation as it was proposed in Β«docking modelsΒ» method by Axtell and Axelrod.Π Π°Π³Π΅Π½ΡΠ½ΠΎ-ΠΎΡΡΡΠ½ΡΠΎΠ²Π°Π½ΠΎΠΌΡ ΠΏΡΠ΄Ρ
ΠΎΠ΄Ρ Π²ΠΈΠ΄ΡΠ»Π΅Π½ΠΎ ΠΊΠΎΠ½ΡΠΎΠ»ΡΠ΄Π°ΡΡΡ Π²Π΅Π»ΠΈΠΊΠΎΡ ΡΡΠ·Π½ΠΎΠΌΠ°Π½ΡΡΠ½ΠΎΡΡΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ. Π ΠΎΠ·ΡΠΎΠ±Π»Π΅Π½Ρ ΠΌΠΎΠ΄Π΅Π»Ρ Π±Π°Π³Π°ΡΡΠΎΡ
Π΄ΠΎΡΠ»ΡΠ΄Π½ΠΈΠΊΡΠ² Ρ ΠΎΠ΄Π½ΠΎΡΠΈΠΏΠ½ΠΈΠΌΠΈ Π·Π° ΠΎΡΠ½ΠΎΠ²Π½ΠΈΠΌΠΈ ΠΎΠ·Π½Π°ΠΊΠ°ΠΌΠΈ, ΠΏΡΠΎΡΠ΅ Ρ ΡΡΠ΅ΡΡ ΡΠΊΠ»Π°Π΄Π½ΠΈΡ
Π°Π΄Π°ΠΏΡΠΈΠ²Π½ΠΈΡ
ΡΠΈΡΡΠ΅ΠΌ ΡΠ°ΠΊΠΈΡ
, ΡΠΊ ΡΡΡΡΠ½Ρ Π΅ΠΊΠΎΠ»ΠΎΠ³ΡΡ Π½Π΅Π·Π½Π°ΡΠ½Π° Π²ΡΠ΄ΠΌΡΠ½Π½ΡΡΡΡ Π² Π°ΡΡ
ΡΡΠ΅ΠΊΡΡΡΡ ΡΠΈ ΡΡΠ·Π½ΠΈΡΡ Π·Π½Π°ΡΠ΅Π½Ρ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΡΠ² ΠΌΠΎΠΆΡΡΡ Π²ΡΠ΄ΡΡΡΠ½ΠΎ Π²ΠΏΠ»ΠΈΠ²Π°ΡΠΈ Π½Π° Π΅ΠΌΠ΅ΡΠ΄ΠΆΠ΅Π½ΡΠ½Ρ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΌΠΎΠ΄Π΅Π»Ρ. ΠΠ΅ΡΡΠΎΠ²ΡΠ΄ΠΊΡΠΈΠ²Π°ΡΠ°ΠΌΠΈ Π°Π³Π΅Π½ΡΠ½ΠΎΠ³ΠΎ ΠΏΡΠ΄Ρ
ΠΎΠ΄Ρ Π΄ΠΎ ΡΡΡΡΠ½ΠΈΡ
Π΅ΠΊΠΎΡΠΈΡΡΠ΅ΠΌ Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ Ρ Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ Π·Π°Π·Π½Π°ΡΠ΅Π½ΠΎ, ΡΠΎ Π½Π°ΡΠ²Π½Π° ΠΌΠ½ΠΎΠΆΠΈΠ½Π° Π±Π°Π³Π°ΡΠΎΠ°Π³Π΅Π½ΡΠ½ΠΈΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΠΏΠΎΡΡΠ΅Π±ΡΡ Π²ΠΏΡΠΎΠ²Π°Π΄ΠΆΠ΅Π½Π½Ρ ΡΠ΅Ρ
Π½ΡΠΊ ΡΠ° ΠΌΠ΅ΡΠΎΠ΄ΠΈΠΊ, ΡΠΎ Π΄ΠΎΠ·Π²ΠΎΠ»ΡΡΡ ΡΠ·Π°Π³Π°Π»ΡΠ½ΠΈΡΠΈ ΡΡ
ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΈ. ΠΠΎΠ΄Π°Π½ΠΎ ΠΌΠΎΠ΄Π΅Π»Ρ, ΡΠΎ Ρ ΡΠ΅ΠΏΠ»ΡΠΊΠ°ΡΡΡΡ ΡΠΆΠ΅ ΡΡΠ½ΡΡΡΠΎΡ Ρ ΠΏΠΎΠ΄ΡΠ±Π½ΠΎΡ Π΄ΠΎ ΠΊΠ»Π°ΡΠΈΡΠ½ΠΈΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΡΡΡΠ½ΠΎΠ³ΠΎ ΠΆΠΈΡΡΡ Ρ ΠΊΠ»ΡΡΠΈΠ½Π½ΠΎΠΌΡ ΠΏΡΠΎΡΡΠΎΡΡ. ΠΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ Π·Π°Π»Π΅ΠΆΠ½ΡΡΡΡ Π°Π³ΡΠ΅ΡΠΈΠ²Π½ΠΎΡ ΡΠ° ΠΌΠΈΡΠ½ΠΎΡ ΠΏΠΎΠ²Π΅Π΄ΡΠ½ΠΊΠΈ Π²ΡΠ΄ ΠΊΡΠ»ΡΠΊΠΎΡΡΡ ΡΠ΅ΡΡΡΡΡ, ΡΠΎ Π½Π°Π΄Ρ
ΠΎΠ΄ΠΈΡΡ Π΄ΠΎ ΡΠΈΡΡΠ΅ΠΌΠΈ. ΠΠΎΡΡΠ²Π½ΡΠ½ΠΎ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΈ ΠΏΠΎΡΠΎΡΠ½ΠΎΡ ΠΌΠΎΠ΄Π΅Π»Ρ-ΡΠ΅ΠΏΠ»ΡΠΊΠ°ΡΡΡ ΡΠ° ΡΡ ΠΏΡΠΎΡΠΎΡΠΈΠΏΡ, Π·Π°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎΠ³ΠΎ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ ΡΠ° ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ Ρ ΠΌΠ΅ΡΠΎΠ΄Ρ "ΡΡΠΈΠΊΡΠ²Π°Π½Π½Ρ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ".Π Π°Π³Π΅Π½ΡΠ½ΠΎ-ΠΎΡΠΈΠ΅Π½ΡΠΈΡΠΎΠ²Π°Π½Π½ΠΎΠΌ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π΅ Π²ΡΠ΄Π΅Π»Π΅Π½Π° ΠΊΠΎΠ½ΡΠΎΠ»ΠΈΠ΄Π°ΡΠΈΡ Π±ΠΎΠ»ΡΡΠΎΠ³ΠΎ ΡΠ°Π·Π½ΠΎΠΎΠ±ΡΠ°Π·ΠΈΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ. Π Π°Π·ΡΠ°Π±ΠΎΡΠ°Π½Π½ΡΠ΅ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΠΌΠ½ΠΎΠ³ΠΈΡ
ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»Π΅ΠΉ ΡΠ²Π»ΡΡΡΡΡ ΠΎΠ΄Π½ΠΎΡΠΈΠΏΠ½ΡΠΌΠΈ ΠΏΠΎ ΠΎΡΠ½ΠΎΠ²Π½ΡΠΌ ΠΏΡΠΈΠ·Π½Π°ΠΊΠ°ΠΌ, ΠΎΠ΄Π½Π°ΠΊΠΎ Π² ΡΡΠ΅ΡΠ΅ ΡΠ»ΠΎΠΆΠ½ΡΡ
Π°Π΄Π°ΠΏΡΠΈΠ²Π½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ ΡΠ°ΠΊΠΈΡ
, ΠΊΠ°ΠΊ ΠΈΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΡΠ΅ ΡΠΊΠΎΠ»ΠΎΠ³ΠΈΠΈ Π½Π΅Π·Π½Π°ΡΠΈΡΠ΅Π»ΡΠ½ΠΎΠ΅ ΠΎΡΠ»ΠΈΡΠΈΠ΅ Π² Π°ΡΡ
ΠΈΡΠ΅ΠΊΡΡΡΠ΅ ΠΈΠ»ΠΈ ΡΠ°Π·Π½ΠΈΡΠ° Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΎΠ² ΠΌΠΎΠ³ΡΡ ΠΈΠΌΠ΅ΡΡ Π΄ΠΎΡΡΠ°ΡΠΎΡΠ½ΠΎ Π±ΠΎΠ»ΡΡΠΎΠ΅ Π²Π»ΠΈΡΠ½ΠΈΠ΅ Π½Π° ΡΠΌΠ΅ΡΠ΄ΠΆΠ΅Π½ΡΠ½ΡΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΌΠΎΠ΄Π΅Π»ΠΈ. ΠΠ΅ΡΠ²ΠΎΠΎΡΠΊΡΡΠ²Π°ΡΠ΅Π»ΡΠΌΠΈ Π°Π³Π΅Π½ΡΠ½ΠΎΠ³ΠΎ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄Π° Π² ΠΈΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΡΡ
ΡΠΊΠΎΡΠΈΡΡΠ΅ΠΌΠ°Ρ
Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ ΠΈ Π ΠΎΠ±Π΅ΡΡΠΎΠΌ ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ ΠΎΡΠΌΠ΅ΡΠ΅Π½ΠΎ, ΡΡΠΎ ΠΈΠΌΠ΅ΡΡΠ΅Π΅ΡΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²ΠΎ ΠΌΠ½ΠΎΠ³ΠΎΠ°Π³Π΅Π½ΡΠ½ΡΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΡΡΠ΅Π±ΡΠ΅Ρ Π²Π½Π΅Π΄ΡΠ΅Π½ΠΈΡ ΡΠ΅Ρ
Π½ΠΈΠΊ ΠΈ ΠΌΠ΅ΡΠΎΠ΄ΠΈΠΊ, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΡ ΠΎΠ±ΠΎΠ±ΡΠΈΡΡ ΠΈΡ
ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ. ΠΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π° ΠΌΠΎΠ΄Π΅Π»Ρ, ΠΊΠΎΡΠΎΡΠ°Ρ ΡΠ²Π»ΡΠ΅ΡΡΡ ΡΠ΅ΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠ΅ΠΉ ΡΠΆΠ΅ ΡΡΡΠ΅ΡΡΠ²ΡΡΡΠ΅ΠΉ ΠΈ ΠΏΠΎΠ΄ΠΎΠ±Π½Π° ΠΊΠ»Π°ΡΡΠΈΡΠ΅ΡΠΊΠΈΠΌ ΠΌΠΎΠ΄Π΅Π»ΡΠΌ ΠΈΡΠΊΡΡΡΡΠ²Π΅Π½Π½ΠΎΠΉ ΠΆΠΈΠ·Π½ΠΈ Π² ΠΊΠ»Π΅ΡΠΎΡΠ½ΠΎΠΌ ΠΏΡΠΎΡΡΡΠ°Π½ΡΡΠ²Π΅. ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½Π° Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΡ Π°Π³ΡΠ΅ΡΡΠΈΠ²Π½ΠΎΠ³ΠΎ ΠΈ ΠΌΠΈΡΠ½ΠΎΠ³ΠΎ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΡ Π² Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΠΈ ΠΎΡ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²Π° ΡΠ΅ΡΡΡΡΠ°, ΠΏΠΎΡΡΡΠΏΠ°ΡΡΠ΅Π³ΠΎ Π² ΡΠΈΡΡΠ΅ΠΌΡ. ΠΡΠΎΠ²Π΅Π΄Π΅Π½ΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΠ΅ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠΎΠ² ΡΠ΅ΠΊΡΡΠ΅ΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ-ΡΠ΅ΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠΈ ΠΈ Π΅Π΅ ΠΏΡΠΎΡΠΎΡΠΈΠΏΠ°, ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎΠ³ΠΎ ΠΠΊΡΡΠ΅Π»ΠΎΠΌ ΠΈ ΠΠΊΡΠ΅Π»ΡΡΠΎΠ΄ΠΎΠΌ Π² ΠΌΠ΅ΡΠΎΠ΄Π΅ Β«ΡΡΡΠΊΠΎΠ²ΠΊΠ° ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉΒ»
Cross-Layer Optimization and Dynamic Spectrum Access for Distributed Wireless Networks
We proposed a novel spectrum allocation approach for distributed cognitive radio networks. Cognitive radio systems are capable of sensing the prevailing environmental conditions and automatically adapting its operating parameters in order to enhance system and network performance. Using this technology, our proposed approach optimizes each individual wireless device and its single-hop communication links using the partial operating parameter and environmental information from adjacent devices within the wireless network. Assuming stationary wireless nodes, all wireless communication links employ non-contiguous orthogonal frequency division multiplexing (NC-OFDM) in order to enable dynamic spectrum access (DSA). The proposed approach will attempt to simultaneously minimize the bit error rate, minimize out-of-band (OOB) interference, and maximize overall throughput using a multi-objective fitness function. Without loss in generality, genetic algorithms are employed to perform the actual optimization. Two generic optimization approaches, subcarrier-wise approach and block-wise approach, were proposed to access spectrum. We also proposed and analyzed several approaches implemented via genetic algorithms (GA), such as quantizing variables, using adaptive variable ranges, and Multi-Objective Genetic Algorithms, for increasing the speed and improving the results of combined spectrum utilization/cross-layer optimization approaches proposed, together with several assisting processes and modifications devised to make the optimization to improve efficiency and execution time
- β¦