This paper tries to estimate the capital investment required for the fixed-telephony network switching equipment as demanded by the fourth national development plan. As a first step, the Cobb-Douglas model is used as a successful demand forecasting model to estimate the demand over the target years. Then, an architectural plan is developed for the fixed-telephony switching network that takes in...

Differentiation is an important task in control, observation, and fault detection. Levant’s differentiator unique, since it able to estimate exactly robustly the derivatives of a signal with bounded high-order derivative. However, convergence time, although finite, grows unboundedly norm initial differentiation error, making uncertain when estimated derivative exact. In this article, we propose...

Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events...

Planning operations for an autonomous agent is a much-studied problem. Most solutions require that the agent’s domain be fully known at the time of planning and fixed during execution. For many domains, however, this is not possible. One approach to the problem is to construct an initial plan based on the best information a priori and revise the plan during execution as better information becom...

The ability to plan and react in dynamic environments is central to intelligent behavior yet few algorithms have managed to combine fast planping with a robust execution. In this paper we develop one such algorithm by looking at planning as real time search. For that we develop a variation of Korf’s Learning Real Time A* algorithm together with a suitable heuristic function. The resulting algor...

The ability to plan and react in dynamic environments is central to intelligent behavior yet few algorithms have managed to combine fast planning with a robust execution. In this paper we develop one such algorithm by looking at planning as real time search. For that we develop a variation of Korf’s Learning Real Time A* algorithm together with a suitable heuristic function. The resulting algor...