Reference: Installing Python scripts and modules
├── my_pkg
│ ├── setup.py
│ ├── scripts
│ │ └── executable_script
└── src
/** | |
* Returns a set of Strings which represent vertices' data at the k-th level from | |
* the vertex with given data "start". The level is 0 at the given vertex. The level | |
* increments by 1 when traversal goes one level deeper. For example, consider a graph | |
* where A has children {B,C}, B has children {D}, C has children {A}. Then when this | |
* method is called as kthLevelChildren("A", 2), the resulting set would contain | |
* {A, D}, since these vertices are 2 levels starting from "A". | |
* | |
* Note: the purpose of this method is more for testing, in the context of homework 6. | |
* |
# Some important aliases | |
SAFE_RM_DIR=${SAFE_RM_DIR:="$HOME/.safe_rm"} | |
REAL_RM=${REAL_RM:="/bin/rm"} | |
# Override rm, because it's always painful to recover | |
# files deleted by rm, if possible at all. Instead, | |
# simply move it to the $SAFE_RM_DIR for later cleaning. | |
rm() | |
{ | |
force=false |
""" | |
plots series functions | |
""" | |
import math | |
import sympy | |
from pprint import pprint | |
import matplotlib.pyplot as plt | |
# constants | |
EVEN=1 |
""" | |
Computes Legendre Polynomials | |
M m (2n-2m)! n-2m | |
P (x) = sum (-1) ------------------- x | |
n m=0 n | |
2 m! (n-m)! (n-2m)! | |
where M = n // 2 |
Reference: Installing Python scripts and modules
├── my_pkg
│ ├── setup.py
│ ├── scripts
│ │ └── executable_script
└── src
<?xml version="1.0"?> | |
<launch> | |
<arg name="limited" default="false" | |
doc="If true, limits joint range [-PI, PI] on all joints." /> | |
<arg name="paused" default="true" | |
doc="Starts gazebo in paused mode" /> | |
<arg name="gui" default="true" | |
doc="Starts gazebo gui" /> | |
<!-- Robot pose --> | |
<arg name="x" default="0"/> |
;;; package --- Summary | |
;;;; Commentary: | |
;;; Code: | |
(require 'cl) | |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; | |
;; Note taking ;; |
""" | |
Example of defining a small, tabular POMDP and solving | |
it using Cassandra's pomdp-solve value iteration solver. | |
Refer to documentation: | |
https://h2r.github.io/pomdp-py/html/examples.external_solvers.html | |
""" | |
import pomdp_py | |
def cryingbaby(): |
# Using ROS Humble | |
# /author: Kaiyu Zheng | |
import rclpy | |
import message_filters | |
import geometry_msgs.msg | |
import std_msgs.msg | |
from rclpy.node import Node | |
from rclpy.qos import QoSProfile, QoSDurabilityPolicy | |
// Using ROS Humble | |
// /author: Kaiyu Zheng | |
#include <chrono> | |
#include <rclcpp/rclcpp.hpp> | |
#include <message_filters/subscriber.h> | |
#include <message_filters/synchronizer.h> | |
#include <message_filters/sync_policies/approximate_time.h> | |
#include <std_msgs/msg/header.hpp> | |
#include <geometry_msgs/msg/point_stamped.hpp> |