Decision making at the front end of innovation: The hidden influence of knowledge and decision criteria

Decision making at the front end of innovation is critical for the success of companies. This paper presents a method, called decision making based on knowledge (DeBK), which was created to analyze the decision-making process at the front end. The method evaluates the knowledge of project information and the importance of decision criteria, compiling a measure that indicates whether decisions are founded on available knowledge and what criteria are in fact being considered to delineate them. The potential contribution of DeBK is corroborated through two projects that faced decision-making issues at the front end of innovation. © 2014 RADMA and John Wiley & Sons Ltd.

Proposal of a method to clarify and enhance decision-making at the front-end of innovation

Decision-making at the front-end of innovation is critical for the success of companies. This paper presents a simple visual method, called DMCA (Decision-Making Criteria Assessment), which was created to clarify and improve decision-making at the front-end of innovation. The method maps the uncertainty of project information and importance of decision criteria, compiling a measure that indicates whether the decision is highly uncertain, what information interferes with it, and what criteria are actually being considered. The DMCA method was tested in two projects that faced decision-making issues, and the results confirm the benefits of using this method in decision-making at the front-end. © 2012 IEEE.

Motor effort alters changes of mind in sensorimotor decision making.

After committing to an action, a decision-maker can change their mind to revise the action. Such changes of mind can even occur when the stream of information that led to the action is curtailed at movement onset. This is explained by the time delays in sensory processing and motor planning which lead to a component at the end of the sensory stream that can only be processed after initiation. Such post-initiation processing can explain the pattern of changes of mind by asserting an accumulation of additional evidence to a criterion level, termed change-of-mind bound. Here we test the hypothesis that physical effort associated with the movement required to change one's mind affects the level of the change-of-mind bound and the time for post-initiation deliberation. We varied the effort required to change from one choice target to another in a reaching movement by varying the geometry of the choice targets or by applying a force field between the targets. We show that there is a reduction in the frequency of change of mind when the separation of the choice targets would require a larger excursion of the hand from the initial to the opposite choice. The reduction is best explained by an increase in the evidence required for changes of mind and a reduced time period of integration after the initial decision. Thus the criteria to revise an initial choice is sensitive to energetic costs.

Sequential decision making in general state space models

Many problems in control and signal processing can be formulated as sequential decision problems for general state space models. However, except for some simple models one cannot obtain analytical solutions and has to resort to approximation. In this thesis, we have investigated problems where Sequential Monte Carlo (SMC) methods can be combined with a gradient based search to provide solutions to online optimisation problems. We summarise the main contributions of the thesis as follows. Chapter 4 focuses on solving the sensor scheduling problem when cast as a controlled Hidden Markov Model. We consider the case in which the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. In sensor scheduling, our aim is to minimise the variance of the estimation error of the hidden state with respect to the action sequence. We present a novel SMC method that uses a stochastic gradient algorithm to find optimal actions. This is in contrast to existing works in the literature that only solve approximations to the original problem. In Chapter 5 we presented how an SMC can be used to solve a risk sensitive control problem. We adopt the use of the Feynman-Kac representation of a controlled Markov chain flow and exploit the properties of the logarithmic Lyapunov exponent, which lead to a policy gradient solution for the parameterised problem. The resulting SMC algorithm follows a similar structure with the Recursive Maximum Likelihood(RML) algorithm for online parameter estimation. In Chapters 6, 7 and 8, dynamic Graphical models were combined with with state space models for the purpose of online decentralised inference. We have concentrated more on the distributed parameter estimation problem using two Maximum Likelihood techniques, namely Recursive Maximum Likelihood (RML) and Expectation Maximization (EM). The resulting algorithms can be interpreted as an extension of the Belief Propagation (BP) algorithm to compute likelihood gradients. In order to design an SMC algorithm, in Chapter 8 uses a nonparametric approximations for Belief Propagation. The algorithms were successfully applied to solve the sensor localisation problem for sensor networks of small and medium size.