Exposing a sensor to a light – projects points that project to all the sensor – and so all locations on the sensor see light from all the points. Aperture(small hole) – seeing light from only one point(inverted and reduced). How big should the aperture be ? until diffraction happensContinue Reading
Rate of Growth in regards with input of n (Big Order of growth notation): Asymptotically Tight Bound (Θ) : Big O(Θ) is noted to give us the upper (max) bound (worst case scenario , with the largest constant k1) and a lower (min) bound (best case scenrio) as well withContinue Reading
A heuristic technique is not guaranteed to be optimal, but which is nevertheless sufficient for reaching an immediate, short-term goal, with a satisfactory solution. Examples of such: Trial and error, Rule of thumb, Educated guess, Intuitive judgment, Guesstimate, Profiling, Common sense. More concrete examples are: * Sorting and prioritizing isContinue Reading
Property P(n) holds for every natural number n(0….N) or every between (x∈N…N) The method of induction requires two cases to be proved. The base case (or, sometimes, the basis), proves that the property holds for the number 0. (This is easy to compute and check for the number n). TheContinue Reading
Hybrid A* is a function that differs from A* by the fact that it is continuous but isn’t complete, that is, it can’t always find an optimal solution or a solution, but every solution that it does find is continuous and constrain-able.Continue Reading
Potential field (represented by a number or tensor, that has a value for each point in space-time) combines attraction to the goal, and repulsion from obstacles in order to plan a path for an autonomous system. most commonly used attractive potential function is: where, ε is a positive scaling factor, p(q, qgoal)Continue Reading
RRT is a searching algorithm applied by building a space filling tree from samples drawn randomly of high-dimensional search spaces . import networkx as nx import numpy as np from sklearn.neighbors import KDTree class RRT: def __init__(self,x_init): self.tree = nx.DiGraph() self.tree.add_node(x_init) def nearest_neighbour(x_rand,rrr): dist=1000 x_rand = np.array(x_rand) for node inContinue Reading
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: true Example 2: Input: -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome. ExampleContinue Reading
Hidden Markov Model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process with unobservable (i.e. hidden) states. In simpler Markov models (like a Markov chain), the state is directly visible to the observer, and therefore the state transition probabilities areContinue Reading
Hidden states are the unknowns we try to detect or predict. The Hidden states have a relationship amongst themselves called the transition probabilities. Observations are the evidence variables that we have a priori. Observations and states have a relationship between them called the emission probabilities.Continue Reading