Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...

We consider a bulk service G I / M / l queue with service rates depending on service batch size. If there are n customers waiting at the completion of service, min(n, I\) customers enter service. We show that the queue size and the service batch size at points of arrivals form an embedded Markov chain and the steady-state probabilities of this Markov chain have the matrix geometric form. We des...

Both path and speed planning play key roles in automated driving, specially when a certain comfort level is required. This paper proposes human-like method for already defined paths while minimizing travel time. The proposed able to compute time-optimal profile that meet the given constrains with regard speed, acceleration jerk. For this purpose, an initial acceleration-limited approach introdu...

In this article, free-will arbitrary time consensus protocols are proposed for multi-agent systems with single- and double- (possibly higher-order) integrator dynamics, respectively, switching) connected interaction graphs bounded matched disturbances. Under the laws, an average is achieved in a prespecified regardless of initial conditions or any other design parameters. Further, laws case no ...