Sanjeev Naguleswaran

Quantum search in stochastic planning

There has been recent interest in implementing automated planning by optimizing a planning domain modeled as a stochastic system. Planning is viewed as a process where sequential decision problems are solved in order to reach the goal, and thus, can be considered as instances of a Markov Decision Process (MDP). However, standard MDP techniques cannot solve a typical planning problem in polynomial time. Hence, the motivation for investigating the use of quantum search techniques based on the Grover Search Algorithm, to identify policies with high utility.

Planning without state space explosion: Petri net to Markov decision process

This paper explores the construction of a Markov decision process (MDP) from a predicate transition net representation of a planning problem, which can be optimised using dynamic programming methods. The construction methodology alleviates the problem of state space explosion.

Reduced MDP representation of a logistical planning problem using petri-nets

This paper describes a method for unfolding a Predicate-net representation of a logistical planning problem, such that it possesses the Markov property. The problem can then be easily converted into a Markov Decision Process (MDP) which can be solved in a tractable manner using standard Dynamic Programming algorithms.

Resource allocation in adhoc networks using Markov Random Fields

We present a general theoretical framework based on Markov Random Fields (MRF) for analysing the communication parameters of adhoc and sensor networks. The applicability and adaptability of MRFs to this type of analysis is discussed. Simulation results based on alternative representations within the MRF framework are also presented.

Quantum walks, automata, and structured search

We explore the application of a quantum algorithm to optimisation problems over a structured space. For example, problems in automated planning can be represented as automata. These automata are shown to posses algebraic structure that can be exploited by a quantum period finding algorithm. The fact that the quantum walk also provides exponential speed-up over these same structures is of particular interest and results of our investigation will be presented.

Achieving policy defined networking for military operations

There has been significant recent progress in the area of software defined networking in a quest to increase automation, improve network agility and security, simplify network configuration and reduce resources to establish and maintain the network. There are a number of studies exploring the development and utilisation of policies to achieve these goals. Applying the outcomes of these studies to military networks requires a clear understanding of the nature of military applications and available mechanisms to implement the appropriate policies in a software defined networking environment. In this paper, we identify several military networks where automated policy defined networking is crucial. We further present a prototype policy defined networking solution that automatically translates high-level policies into device level implementations.

A new methodology for the identification of operational stress points and assessment of technology solutions

Military operations place demands on command support systems and communications infrastructure that vary according to the phase of the operation. We present here a new methodology for the analysis of operational architecture products that enables the ready identification of stress points in the command, control and communications (C3) systems supporting operations. We then combine this with a comprehensive technology assessment framework, where we seek to match specific technologies against the specific Information Exchange Requirements (IER) at the identified C3 stress points. In addition to specific information and communications requirements, the assessment framework also considers a range of factors critical to the successful uptake of new technologies into existing contexts. These factors include technology type, scope of applicability, technology maturity, operational impact and architectural and organisational match.

Strategic planning and operational control in dynamically networked environments

We present a scheme for optimised planning that can be applied across strategic, operational and tactical scenarios. In a network centric world, a network to support an effective command and control system is ensured by incorporating aspects of the underlying communication network in the objective function used to select the optimal strategy. This approach provides more reliability and efficiency to dynamically changing networked operations.

Analytic views of quantum walks

The first general analytic solutions for the one-dimensional quantum walk in position and momentum space are derived. These solutions reveal new symmetry features of quantum walk probability densities and insight into the behaviour of their moments. The analytic expressions for the quantum walk probability distributions provide a means of modelling quantum phenomena that is analogous to that provided by random walks in the classical domain.

A systems approach to the quantum random walk

In this paper we address the quantum random walk on the real line. Specifically, we utilize a dynamical system formulation of the walk, which leads to a momentum space expression of the probability amplitude that is a function of only the initial condition. Our focus is, for the most part, limited to the Hadamard walk. As such, this closed form expression is not as general as that given by [1]. This lack of generality is offset by the ease with which we obtain the expression, and the insight offered by it. Our closed form expression allows us to easily compute the walk pdf, hence the cdf (cumulative distribution function). It is shown that the cdf converges to its limiting form relatively quickly. We push the simple mathematics in an to attempt to obtain a closed form expression for this form. But it becomes too involved to take it to completion in this paper, without running the risk of losing appreciation for the simplicity of our approach.