A set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...

Mobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...

The paper presents a new model of ship collision risk, which utilises a ship domain concept and the related domain-based collision risk parameters. An encounter is here described by five variables representing: degree of domain violation (DDV), relative speed of the two vessels, combination of the vessels’ courses, arena violations and encounter complexity. As for the first three variables, their values can be directly computed...