일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 | 31 |
- Motion Planning
- Graph Neural Network
- C++
- solver
- Frenet Coordinate
- OSQP
- CUDA
- Dubins Path
- 수치최적화
- 정적라이브러리
- C
- self driving car
- 백준
- CPP
- Hybrid A star
- 경로생성
- GNN
- DynamicProgramming
- PathPlanning
- 공유라이브러리
- MDP
- 강화학습
- Recursion
- Leetcode
- path planning
- 선형대수
- autonomous vehicle
- 소프티어
- 동적라이브러리
- GIT
- Today
- Total
목록개념공부 (90)
Swimmer
Reference : https://en.wikipedia.org/wiki/Bitwise_operation Bitwise operation is fast and simple action. because it is directly supported by the processor. On low-cost processors, bitwise operations are substantially faster than division, several times faster than multiplication, somtimes significantly faster than addition. (really??) Bitwise Operator NOT(bitwise complement) NOT 0111 -> 1000, NO..
std::unordered_map This data structure is an associative container the contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constane-time complexity Internally, the elements are not osorte in any particular order, but organized into buckets. Properties Associative container Unique keys Reference : https://en.cppreference.com/w/cpp/container/unordered..
std::map Maps are associative containers that store elements formed by a combination of a key value and mapped value. The key values are generally used to sort and uniquely identify the elements The mapped values store the content associated to this key. The types of key and mapped value may differ. and both are grouped together by pair type typedef pair value_type; Internally, the elements in a..
Function Algorithm for finding the shortest paths between nodes in a graph It fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in a graph It uses a data structure for storing and querying partial solutions sorted by distance from the "source" node (Queue, prioirty - Queue in C++) Time Complexity prioirty queue - $$ \Theta ((\left| V \right| + \..