English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We address a problem of area protection in graph-based scenarios withmultiple agents. The problem consists of two adversarial teams of agents thatmove in an undirected graph shared by both teams. Agents are placed in verticesof the graph; at most one agent can occupy a vertex; and they can move intoadjacent vertices in a conflict free way. Teams have asymmetric goals: the aimof one team - attackers - is to invade into given area while the aim of theopponent team - defenders - is to protect the area from being entered byattackers by occupying selected vertices. We study strategies for allocatingvertices to be occupied by the team of defenders to block attacking agents. Weshow that the decision version of the problem of area protection is PSPACE-hardunder the assumption that agents can allocate their target vertices multipletimes. Further we develop various on-line vertex-allocation strategies for thedefender team in a simplified variant of the problem with single stage vertexallocation and evaluated their performance in multiple benchmarks. The successof a strategy is heavily dependent on the type of the instance, and so one ofthe contributions of this work is that we identify suitable vertex-allocationstrategies for diverse instance types. In particular, we introduce asimulation-based method that identifies and tries to capture bottlenecks in thegraph, that are frequently used by the attackers. Our experimental evaluationsuggests that this method often allows a successful defense even in instanceswhere the attackers significantly outnumber the defenders.

Area Protection in Adversarial Path-Finding Scenarios with Multiple  Mobile Agents on Graphs: a theoretical and experimental study of  target-allocation strategies for defense coordination