Recently the dynamic distance potential field (DDPF) was introduced as a computationally efficient method to make agents in a simulation of pedestrians move rather on the quickest path than the shortest. It can be considered to be an estimated-remaining-journey-timebased one-shot dynamic assignment method for pedestrian route choice on the operational level of dynamics. In this contribution the...

This paper considers the detection of random targets modelled by a hidden Markov chain using distributed multiple sensors. The optimization problem is formulated as an optimal stopping problem which intends to increase the capturing probability of the moving object. The general formulation in this paper may be applied for distributed (change or failure) detection in a networked system, which ge...

For an individual with a prior bachelor's degree, the accelerated second-degree program offers the quickest route to becoming a registered nurse. But does this quick route lead to satisfaction with the educational experience and perceived effectiveness of preparation to be a professional nurse? The author reports the findings of a study of student satisfaction with an accelerated program of stu...

We study the evolutionary dynamics of a mobility system in which agents are able to explore the environment and to communicate between them in order to increase the efficiency of the system, i.e. to minimize the average time needed to reach their goal, choosing the quickest path and avoiding the formation of traffic jams. The agents use an evolvable pheromone-like indirect communication system,...

We consider the problem of quickest detection of abrupt changes for processes that are not necessarily independent and identically distributed (i.i.d.) before and after the change. By making a very simple observation that applies to most well-known optimum stopping times developed for this problem (in particular CUSUM and Shiryayev–Roberts stopping rule) we show that their optimality can be eas...

A quickest change detection problem is considered in a sensor network with observations whose statistical dependency structure across the sensors before and after described by decomposable graphical model (DGM). Distributed computation methods for this are proposed that capable of producing optimum centralized test statistic. The DGM leads to proper way collect nodes into local groups equivalen...

The COVID-19 pandemic has, worldwide and up to December 2020, caused over 1.7 million deaths, put the world's most advanced healthcare systems under heavy stress. In many countries, drastic restrictive measures adopted by political authorities, such as national lockdowns, have not prevented outbreak of new pandemic's waves. this article, we propose an integrated detection-estimation-forecasting...